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
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define ll long long


const ll maxn = 5e5 + 7;
ll n, x, res, t[maxn], R, suma;
vector<int> v;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x;
        t[x]++;
    }
    for(int i = 1; i <= n; i++){
        if(t[i] > 0){
            v.push_back(t[i]);
            suma += t[i];
        }
    }
    sort(v.begin(), v.end());
    for(int i = v.size() - 1; i >= 0; i--){
        R += v[i];
        if(R - (v.size() - i) >= suma - R){
            cout << v.size() - i << '\n';
            return 0;
        }
    }


    cout << n << '\n';
}