Submission #5785706

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

int main(){int N; cin >> N; string ans;
           vector<string> A(N);
           for(int i = 0 ; i < N; i++){cin >> A[i];}
           sort(A.begin(),A.end()); int i = 0; int max_cnt = 1;
           while( i < N){ int cnt = 1;
             while( i < N - 1 && A[i] == A[i+1]){
               cnt++; i++;}
             if( cnt >= max_cnt){  ans = A[i]; max_cnt = cnt;}
                                i++;}
           cout << ans << endl; return 0;}
               

Submission Info

Judge Result