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

using namespace std;

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

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

    sort(cnt.begin(), cnt.end());

    vector<int> siz;
    for(int i = n; i > 0; i--) {
        if(cnt[i] != 0) siz.push_back(cnt[i]);
        else break;
    }

    int res = 0;
    int i = 0;
    for(; i < siz.size() - 1; i++) {
        res++;
        siz[i]--;
        while(siz[i] > 0 && i < siz.size() - 1) {
            if(siz[i] >= siz.back()) {
                siz[i] -= siz.back();
                siz.pop_back();
            } else {
                siz.back() -= siz[i];
                siz[i] = 0;
            }
        }
    }

    if(i == siz.size() - 1) res++;

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