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

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    int n; cin >> n;
    vector<int>cnt(n);
    for(int i = 0; i < n; i++) {
        int x; cin >> x;
        cnt[x - 1]++;
    }
    sort(cnt.begin(), cnt.end());
    
    int k = 0;
    int groups = 0;
    for(int i = n - 1; i > k; i--) {
        groups++;
        int taken = 0;
        while(taken + 1 < cnt[i] && k < i) {
            if(cnt[k] == 0) {
                k++;
            } else {
                cnt[k]--;
                taken++;
            }
        }
        cnt[i] = 0;
    }
    sort(cnt.begin(), cnt.end());
    if(cnt.back() != 0)
        groups++;
    
    cout << groups << "\n";
    
    
    return 0;
}