Submission #2175676

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

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

Submission Info

Judge Result