Submission #5991133

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <sstream>
using namespace std;

int main(void){
   int n;
   cin >> n;
   string s[n];
   for(int i = 0; i < n; i++)
        cin >> s[i];
    int count = 1;
    int ans = 0;
    int check;
    for(int i = 0; i < n-1; i++){
        for(int j = i+1; j < n; j++){
            if(s[i]>s[j])
                swap(s[i], s[j]);
        }
    }
    for(int i = 0; i < n; i++){
        if(s[i]==s[i+1])
            count++;
        else if(s[i] != s[i+1]){
            if(ans < count){
                check = i;
                ans = count;
                count = 1;
            }
        }
    }
    cout << s[check] << endl;
    return 0;
}

Submission Info

Judge Result