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


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

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

    vector <int> v;
    for (int i = 1; i <= n; i++) if (cnt[i]) v.push_back(cnt[i]);
    sort(v.begin(), v.end());  

    int i = 0, j = v.size() - 1, ans = 1, cur = 0;
    while (i < j) {
        if (cur + v[i] < v[j]) {
            cur += v[i++];
        }
        else {
            int ile = v[j] - 1 - cur;
            v[i] -= ile;
            j--;
            ans++;
            cur = 0;
        }
    }
    cout << ans << '\n';
}