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
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;

    vector<int> a(n);
    vector<int> b(n, 0);
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
        b[a[i]]++;
    }
    sort(b.begin(), b.end());

    int w = n;
    for(int i = n - 1; true; i--)
    {
        if(w <= 0)
        {
            cout<<(n - 1) - i;
            break;
        }
        w-=b[i];
        w -= (b[i] - 1);
    }
    return 0;
}