[BOJ] 11652 카드(정렬).cpp

#include <iostream>
#include <algorithm>
using namespace std;

long long a[1000000];

int main() {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    sort(a,a+n);

    long long ans = a[0];
    int cnt = 1;
    int ans_cnt = 1;
    for (int i = 1; i < n; i++) {
        if (a[i] == a[i-1]) {
            cnt++;
        }
        else {
            cnt = 1;
        }
        if (ans_cnt < cnt) {
            ans = a[i];
            ans_cnt = cnt;
        }
    }
    
    cout << ans << endl;
    
    return 0;
}