Submission #7131139

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<string>
#include<queue>
#include<utility>
#include<cmath>

using namespace std;


int main()
{

  int N;
  cin >> N;

  string S[N];
  for(int i=0; i<N; i++){
    cin >> S[i];
  }

  int max_cnt = 0;
  int max_id = 0;
  for(int i=0; i<N; i++){
    int cnt = 0;
    for(int j=i+1; j<N; j++){
      if(S[i] == S[j]){
        cnt++;
      }
    }
    if( max_cnt < cnt){
      max_id = i;
    }
  }

  cout << S[max_id] << endl;

  return 0;
}

Submission Info

Judge Result