Submission #5906074

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
//const int mod = 1000000007;
int main() {
    int n;
    int index = -1;
    int maxCount = 0;
    cin >> n;
    vector<string> s(n), d;
    vector<int> cnt;
    rep(i, n) cin >> s[i];
    rep(i, n) {
        bool isNone = true;
        rep(j, d.size()) {
            string si = s[i];
            string di = d[j];
            if (si == di) {
                isNone = false;
            }
        }

        if(isNone == true) {
            d.push_back(s[i]);
            cnt.push_back(1);
        } else {
            rep(j, d.size()) {
                string si = s[i];
                string di = d[j];
                if (si == di) {
                    cnt[j] += 1;
                }
            }
        }
    }

    vector<pair<int, string>> ans(d.size());
    rep(i, d.size()) {
        ans[i] = make_pair(cnt[i], d[i]);
    }

    sort(all(ans));
    reverse(all(ans));
    cout << ans[0].second << endl;
}

Submission Info

Judge Result