Submission #4410515

---

Source Code Expand

#include "bits/stdc++.h"
#define double long double
#define int long long
#define mii map<int,int>
#define pii pair<int,int>
#define low lower_bound
#define upp upper_bound
#define mod 1000000007 //10^9+7
#define inf 10000000000000000 //10^16
#define rep(i,n) for(int i=0;i<n;i++)
#define all(vec) vec.begin(),vec.end()
#define vsort(vec) sort(all(vec))
#define vrever(vec) reverse(all(vec));
#define vunsort(vec) vsort(vec); vrever(vec);
#define bisea binary_search
#define cend cout<<endl;
#define F first
#define S second
#define P pair<int,int>
using namespace std;

signed main() {
	int n;
	cin>>n;
	string s[n];
	map<string,int>mp;
	map<int,string>m;
	rep(i,n) {
		string a;
		cin>>a;
		s[i]=a;
		mp[a]++;
	}
	int MAX=0;
	rep(i,n) {
		m[mp[s[i]]]=s[i];
		MAX=max(MAX,mp[s[i]]);
	}
	cout<<m[MAX]<<endl;
}

Submission Info

Judge Result