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
#include<bits/stdc++.h>

using namespace std;

const int maxn=500009;
int tab[maxn];
vector<int> vec;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, a, suma=0;
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> a;
        tab[a]++;
    }
    suma=n;
    for(int i=1; i<=n; i++) {
		if(tab[i]==0) {
			continue;
		}
        vec.push_back(tab[i]);
    }
    sort(vec.begin(), vec.end());
    reverse(vec.begin(), vec.end());
    int ilemozna=0, idx=1;
   // cout << vec[1] << endl;
    for(auto c:vec) {
		//cout << c << endl;
        suma-=c;
        ilemozna+=c-1;
        if(ilemozna>=suma) {
            cout << idx;
            return 0;
        }
        idx++;
    }
}
/*
9
5 2 5 7 6 8 1 7 7 
*/