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 n;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) cin>>v[i];
    sort(v.begin(), v.end());
    vector<int> pom;
    int x=1;
    for (int i = 1; i < n; i++){
        if (v[i-1] != v[i]){
            pom.push_back(x);
            x = 0;
        }
        x++;
    }
    pom.push_back(x);
    sort(pom.begin(), pom.end(), greater<int>());
    // for (auto i : pom) cout<<i<<" ";
    // cout<<"\n";
    int wsk = pom.size()-1;
    for (int i = 0; i < pom.size(); i++){
        if (!pom[i]){
            cout<<i<<"\n";
            return 0;
        }
        // cout<<wsk<<"\n";
        // for (auto j : pom) cout<<j<<" ";
        // cout<<"\n";
        pom[i]--;
        while (wsk > i && pom[i]){
            if (pom[wsk] <= pom[i]){
                pom[i] -= pom[wsk];
                pom[wsk] = 0;
                wsk--;
            }
            else{
                pom[wsk] -= pom[i];
                pom[i] = 0;
            }
        }
    }
    cout<<pom.size()<<"\n";
    return 0;
}