Submission #739700

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>

#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())

#define LL long long
#define LD long double

using namespace std;

//================================================
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	string ans;
	int N;
	cin >> N;

	string tmp = "";
	map<string, int>result;
	REP(i, N) {
		cin >> tmp;
		result[tmp]++;
	}
	int pollMax = 0;
	for (auto it = result.begin(); it != result.end(); it++) {
		if (pollMax < it->second) {
			pollMax = it->second;
			ans = it->first;
		}
	}

	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result