AtCoder 155 C Poll

 1 #pragma GCC optimize(3,"Ofast","inline")
 2 #include<map>
 3 #include<cstdio>
 4 #include<string>
 5 #include<cstring>
 6 #include<iostream>
 7 #include<algorithm>
 8 using namespace std;
 9 const int N = 200009;
10 int n, MN, cnt;
11 string g[N];
12 map<string, int>f;
13 map<string, bool>p;
14 int main()
15 {
16     std::ios::sync_with_stdio(false);
17     cin >> n;
18     for(int i = 1; i <= n; i++)
19     {
20         cin >> g[i];
21         f[g[i]]++;
22     }
23     for(map<string, int>::iterator it = f.begin(); it != f.end(); it++)
24         MN = max(MN, it->second);
25     sort(g+1, g+n+1);
26     int m;
27     for(int i = 1; i <= n; i++)
28     {
29         if(f[g[i]] != MN) continue;
30         m = g[i].length();
31         for(int j = 0; j < m; j++)
32             putchar(g[i][j]);
33         putchar(‘\n‘);
34         f[g[i]] = 0;
35     }
36     return 0;
37 }