Problem:
Score : 100 points

Problem Statement

An elementary school student Takahashi has come to a variety store.

He has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?

Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.

Constraints

All input values are integers.

1 \leq A, B \leq 500

1 \leq C \leq 1000

Input

Input is given from Standard Input in the following format:

A B C

Output

If Takahashi can buy the toy, print Yes; if he cannot, print No.

Sample Input 1

50 100 120

Sample Output 1

Yes

He has 50 + 100 = 150 yen, so he can buy the 120-yen toy.

Sample Input 2

500 100 1000

Sample Output 2

No

He has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.

Sample Input 3

19 123 143

Sample Output 3

No

There are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.

Sample Input 4

19 123 142

Sample Output 4

Yes

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, M, P=0, max, cnt; 
    string most_word;
    cin >> N;
  	vector<string> N_s(N);
  	for(int i=0;i<N;i++){
    	cin >> N_s.at(i);
    }
  	for(int i=0;i<N_s.size();i++){
		for(int j;j<N_s.size();j++){
        	if(N_s.at(i)==N_s.at(j)){
            	cnt++;
            }
          	cnt--;
        }
        if(i==0)max = cnt;
        else if(cnt>max){
        	most_word = N_s.at(i);
        }
            	
    }
  	cin >> M;
	vector<string> M_t(M);
  	for(int i=0;i<M;i++){
    	cin >> M_t.at(i);
    }
  	for(int i=0;i<N;i++){
    	if(N_s.at(i)==most_word)P++;
    }  
    for(int j=0;j<M;j++){	
		if(M_t.at(j)==most_word)P--;
    }
   
  
    cout << P << endl;
}