民间数据过了。

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;

int n, a[N], b[N];
int last;

signed main() {
    cin >> n;
    for (int i = 1; i <= n; i ++ ) {
        cin >> a[i];
        b[a[i]] ++ ;
    }
    sort(a + 1, a + n + 1);
    for (int i = 2; i <= n; i ++ )
        if (a[i] != a[i - 1]) {
            last += b[a[i - 1]];
            if (b[a[i]] >= last) last = 0;
            else last -= b[a[i]];
        }
    cout << last + b[a[n]] << endl;
    return 0;
}