Submission #169355

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define FORI(s, e)		for (int i = (s); i < (e); i++)
#define FOR(i, s, e)	for (int i = (s); i < (e); i++)
#define REP(i, e)		FOR(i, 0, e)
#define sz(a)			(a.size())
#define abs(x)			(((x) < 0) ? -(x) : (x))
#define clean(x)		memset((x), 0, sizeof((x)))

using namespace std;

typedef pair<string, int> P;

int main() {
	int n;
	vector <string> s(50, "");
	string name, mname;
	int c = 0, max = 0;

	cin >> n;
	REP(i, n) cin >> s[i];
	
	sort(s.begin(), s.end());
	
	name = s[0];
	mname = name;
	c++;

	FOR(i, 1, n) {
		if (i == n - 1 || name != s[i]) {
			if (max < c) {
				max = c;
				mname = name;
			}
			c = 0;
			name = s[i];
		}
		c++;
	}
	
	cout << mname << endl;
	
	return 0;
}

Submission Info

Judge Result