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

int edible(int x)
{
    return x - 1;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<int> v;
    map<int, int> m;
    for(int i = 0; i < n; i++)
    {
        int x;
        cin>>x;
        m[x]++;
    }
    for(auto k : m)
    {
        v.push_back(k.second);
    }
   /* for(int x : v)
    {
        cout<<x<<" ";
    }*/
    sort(v.begin(), v.end(), greater<int>());
    int start_index = 0;
    int end_index = v.size() - 1;
    int ans = 0;
    while(v[start_index] != 0 && start_index != v.size()-1)
    {
        ans++;
        int possible = edible(v[start_index]);
        while(possible > 0 && start_index != end_index)
        {
            int to_eat = min(v[end_index], possible);
            v[end_index] -= to_eat;
            possible -= to_eat;
            if(v[end_index] == 0)
            {
                end_index--;
            }
        }
        start_index++;
    }
    cout<<ans;
}