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
#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;
    map<int,int> inty;
    int a;
    for(int i=0;i<n;i++){
        cin >> a;
        inty[a]++;
    }
    vector<int> v;
    for(pair<const int,int> i : inty){
        v.push_back(i.second);
    }
    sort(v.begin(),v.end());
    int dl=v.size();
    int last=v.size()-1;
    //last = biggest
    int sum=0;
    int toSubst,mx;
    int i=0;
    while(n>0){
        mx=v[last];
        v[last]=0;
        n-=mx;
        sum++;
        toSubst=mx-1;
        n-=toSubst;
        while(toSubst>0){
            if(v[i]<=toSubst){
                toSubst-=v[i];
                v[i]=0;
                i++;
            }else{
                v[i]-=toSubst;
                toSubst=0;
            }
            if(i>=dl){
                n=0;
                break;
            }
        }

        last--;
    }
    cout<<sum;
}