Submission #1520383

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <utility>

using namespace std;

int main()
{
	int n, max = 0;
	string s, ans;
	map<string, int> m;
	pair<string, int> p;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> s;
		m[s]++;
	}
	map<string, int> ::iterator itr;
	for (itr = m.begin(); itr != m.end(); itr++) {
		if (max < itr -> second) {
			max = itr -> second;
			ans = itr -> first;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result