Submission #3978219

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <climits>

#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())

// stoi(s): string to int
// stod(s): string to double

// INT_MAX
// INT_MIN
// LLONG_MAX
// LLONG_MIN
// DBL_MIN
// DBL_MAX
// LDBL_MIN
// LDBL_MAX

// A-Z: 65~90
// a-z: 97~122
// |a-z| = 26

using namespace std;
using ll = long long;
int main(int argc, const char * argv[]) {
    int n;
    cin >> n;
    
    vector<string> v(n);
    for(int i = 0; i < n; i++){
        cin >> v[i];
    }
    vsort(v);
    
    int cnt = 1, max = -1;
    string ans = v[0];
    for (int i = 0; i < n - 1; i++) {
        if (v[i] == v[i+1] & (i != n -1 -1)) {
            cnt++;
        }else{
            if (cnt > max) {
                ans = v[i];
                max = cnt;
            }
            cnt = 1;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result