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

int main(){
    int n;
    cin >> n;
    vector<int> arr(n);
    vector<int> amount(n+1);
    for(int i=0; i<n; i++){
        int a;
        cin >> a;
        amount[a]++;
        arr[i]=a;
    }
    sort(amount.begin(), amount.end());
    int smallPnt=0;
    int bigPnt=n;
    while(amount[smallPnt]==0)
        smallPnt++;
    int res=0;
    for(int i=bigPnt; i>=smallPnt; i--){
        if(i==smallPnt){
            res++;
            break;
        }
        int toGive=amount[i]-1;
        while(toGive>0 && smallPnt<=i){
            if(toGive==amount[smallPnt]){
                toGive=0;
                amount[smallPnt]=0;
                smallPnt++;
            }
            else if(toGive<amount[smallPnt]){
                amount[smallPnt]-=toGive;
                toGive=0;
            }
            else{
                toGive-=amount[smallPnt];
                amount[smallPnt]=0;
                smallPnt++;
            }
        }
        if(toGive==0){
            res++;
        }
    }
    cout << res << "\n";
    return 0;
}