1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 5e5+10;

int a[N], cnt[N], n;

void solve() {
    cin>>n;

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

    vector<pii> v;
    for (int i=1; i<=n; ++i) {
        if (cnt[i] == 0) continue;
        v.push_back({cnt[i], i});
    } sort(v.begin(), v.end(), greater<pii>());

    int sm=0;
    for (int i=0; i<n; ++i) {
        sm+=v[i].first-1;
        int x=sm+i+1;

        if (n-x <= sm) {
            cout<<i+1<<"\n";
            return;
        }
    } cout<<n<<"\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    int t=1; //cin>>t;
    while (t--) solve();
}