Submission #1052522

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <string>
#include <iostream>
#include <functional>
#include <vector>
using namespace std;

string tmp;

bool isEqual(const pair<string, int>& element)
{
    return element.first == tmp;
}

bool sort_greator(const pair<string, int> &l, const pair<string, int> &r) {
    if (l.second == r.second) return l.first < r.first;
    return l.second > r.second;
}

int main()
{
    int N;
    vector< pair<string, int> > S;

    cin >> N;

    for (int i = 0; i < N; i++)
    {
        cin >> tmp;

        vector< pair<string, int> >::iterator
            itr = find_if(S.begin(), S.end(), isEqual);

        if (itr != S.end()) itr->second++;
        else S.push_back(make_pair(tmp, 1));
    }

    sort(S.begin(), S.end(), sort_greator);

    cout << S[0].first << endl;
    return 0;
}

Submission Info

Judge Result