Submission #168878

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <complex>
#include <cmath>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vec;
typedef vector<vec> mat;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
const int INF = 1e9;
const int mod = 1e9 + 7;

int main(){
  int N;
  cin >> N;

  map<string,int> msi;
  string s;
  for(int i=0;i<N;++i){
    cin >> s;
    if(msi.count(s)==0)msi[s] = 1;
    else msi[s]++;
  }

  map<string,int>::iterator it = msi.begin();
  int ans =0;
  for(;it!=msi.end();++it){
    if(ans < it->second){
      ans = it->second;
      s = it->first;
    }
  }
  cout << s << endl;
  return 0;
}

Submission Info

Judge Result