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

int n;
int a;

int cnt[500001];

vector<pair<int, int>> nums;

int assigned = 0;

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

    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> a;
        if(cnt[a] == 0){
            nums.push_back({0, a});
        }
        cnt[a]++;
    }
    for(int i = nums.size() - 1; i >= 0; --i){
        nums[i].first = cnt[nums[i].second];
    }

    sort(nums.begin(), nums.end());

    int i = nums.size() - 1;
    while(assigned < n){
        assigned += nums[i].first * 2 - 1;
        i--;
    }

    cout << nums.size() - 1 - i;
}