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
46
47
48
49
#include <iostream>
#include <algorithm>

using namespace std;

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

    int n; cin >> n;

    int* cnt = new int[n + 1];

    for(int i = 0; i <= n; ++i) {
        cnt[i] = 0;
    }

    int x;
    for(int i = 0; i < n; ++i) {
        cin >> x;

        --cnt[x];
    }

    sort(cnt, cnt + n + 1);

    for(int i = 0; i <= n; ++i) {
        cnt[i] *= -1;
    }

    int a = 0;
    int b = n;
    int ans = 0;
    int curr = 0;
    while(a <= b) {
        ++ans;
        curr = cnt[a];
        while(curr - cnt[b] > 0) {
            curr -= cnt[b--];
        }
        cnt[b] -= (curr - 1);
        a++;
    }

    cout << ans << "\n";
    free(cnt);

    return 0;
}