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 <iostream>
#include <algorithm>

using namespace std;

int counts[500001];

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

    int n;
    cin >> n;

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

    std::sort(std::begin(counts), std::end(counts), std::greater<int>());

    int res = 0;
    int k = n;

    int i = 0;
    while(k > 0) {
        int a = counts[i];
        res++;
        i++;
        k -= a;
        k -= a - 1;
    }

    cout << res << endl;

    return 0;
}