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

using namespace std;

map<int,int> vals;
vector<int> arr;

int main(){
    int n;
    cin >> n;
    for(int i = 0 ; i < n; i++){
        int a;
        cin >> a;
        vals[a]++;
    }

    for(auto a : vals){
        arr.push_back(a.second);
    }

    sort(arr.begin(), arr.end(), greater<int>());

    int res = 0;

    int i = 0;
    int k = arr.size()-1;
    while(i <= k){
        res++;
        int free = arr[i]-1;
        i++;
        while(free > 0){
            if(free >= arr[k]){
                free -= arr[k];
                k--;
            }
            else{
                arr[k] -= free;
                free = 0;
            }
        }
    }

    cout << res;

    return 0;
}