Submission #792800

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);i++)
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define FORR(x,arr) for(auto& x:arr)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) begin(c),end(c)
#define PB push_back
#define MP make_pair
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;

int main(int argc, char const *argv[]) {
    int n;
    cin >> n;
    map<string,int> m;
    REP(i,n) {
        string s;
        cin >> s;
        if(m.find(s)==m.end()) {
            m.insert(MP(s,1));
        }
        else {
            m[s]++;
        }
    }
    string ans;
    int M=0;
    ITR(i,m) {
        if(M<(i->second)) {
            ans = i->first;
            M = i->second;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result