Submission #169629

---

Source Code Expand

#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>

using namespace std;

#define REP(i,n) for(int i=0;i<int(n);i++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
typedef long long ll;

int main(void){

	int N;
	cin >> N;
	vector<string>v;
	string s;
	REP(i,N){
		cin >> s;
		v.push_back(s);
	}

	sort(v.begin(),v.end());
	string ans; int c=1,mx=1;
	if(N==1) ans=v[0];
	else{

	REP(i,N-1){
		if(v[i]==v[i+1]){
			c++;
			if(mx<=c){
				mx=c; ans=v[i];
			}
		}else{

			  c=1;
		}
	}

	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result