Submission #1774325

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

/*************** using variables ***************/
int n;
string s;
map<string, int> mp;
int maxnum = 0;
string maxman = {};
/**********************************************/

int main(){
    cin >> n;
    REP(i, n){
        cin >> s;
        auto itr = mp.find(s);
        if(itr == mp.end()){
            mp[s] = 1;
        }else{
            mp[s]++;
        }
    }

    for(auto itr = mp.begin(); itr != mp.end(); ++itr) {
        if(maxnum < itr->second){
            maxnum = itr->second;
            maxman = itr->first;
        }
    }

    cout << maxman << endl;

}

Submission Info

Judge Result