#include <iostream>

#include <algorithm>

using namespace std;

int main(){
    int n, a[200005];
    cin >> n;
    for (int i = 1; i <= n; cin >> a[i++]) {
    }
    sort (a + 1, a + n + 1);
    int ans = n;
    for (int i = 1, j = 1; i <= n; ++i, ++j) {
        for (; j <= n && a[j] <= a[i]; ++j) {
        }
        if (a[j] > a[i]) {
            --ans;
        } else break;
    }
    cout << ans;
    return 0;
}

能 A

#include <iostream>

#include <algorithm>

using namespace std;

int main(){
    int n, a[100005];
    cin >> n;
    for (int i = 1; i <= n; cin >> a[i++]) {
    }
    sort (a + 1, a + n + 1);
    int ans = n;
    for (int i = 1, j = 1; i <= n; ++i, ++j) {
        for (; j <= n && a[j] <= a[i]; ++j) {
        }
        if (a[j] > a[i]) {
            --ans;
        } else break;
    }
    cout << ans;
    return 0;
}

95