Submission #4658100

---

Source Code Expand

#include <ios>
#include <iomanip>
#include <iostream>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <climits>

using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1e9)
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl

ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
typedef pair <ll,ll> P;

int main()
{
    ll N;
    cin >> N;
    map<string, ll> mp;
    rep(i, N) {
        string name;
        cin >> name;
        mp[name]++;
    }
    ll m = 0;
    for(pair<string, ll> p : mp) {
        m = max(m, p.second);
    }
    for(pair<string, ll> p : mp) {
        if (m == p.second) {
            print(p.first);
            return 0;
        }
    }
    return 0;
}

Submission Info

Judge Result