解题思路:
STL Map
注意事项:
答案错误91,原地放弃
参考代码:
int main() { int n; int maxCnt = 0; string input; map<string, int> m; map<string, int>::iterator iter; cin >> n; getchar(); for (int i = 0; i < n; ++i) { getline(cin, input); iter = m.find(input); if (iter != m.end()) { iter->second++; maxCnt = max(maxCnt, iter->second); } else { m.insert(pair<string, int>(input, 1)); } } for (iter = m.begin(); iter != m.end(); ++iter) { if (iter->second == maxCnt) { cout << iter->first << endl; } } return 0; }
0.0分
0 人评分