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
50
51
52
53
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void boost() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}

int n, a[500007], ile[500007], res, p, k;
vector <int> v;

int main() {
    boost();

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

    for (int i = 1; i <= n; i++) {
        if (ile[i] > 0) {
            v.push_back(ile[i]);
        }
    }

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

    p = 0; k = v.size() - 1;
    res = 0;

    while (p <= k) {
		res++;
        int sum = 0;
        while (p < k) {
            if (sum + v[p] < v[k]) {
                sum += v[p];
                p++;
            }
            else {
                v[p] -= (v[k] - sum - 1);
                break;
            }
        }
        k--;
    }

    cout << res << "\n";

    return 0;
}