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

using namespace std;

bool comp(const pair<int, int> &a, const pair<int, int> &b) {
    return a.second > b.second;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    map<int,int> M;
    for(int i=0; i<n; ++i) {
        int a;
        cin>>a;
        M[a]++;
    }

    vector<pair<int, int>> arr(M.begin(), M.end());
    sort(arr.begin(), arr.end(), comp);

    int ans=0;

    for(auto it = arr.begin(); it != arr.end(); ++it) {
        n -= it->second + it->second - 1;
        ans++;
        if(n <= 0)
            break;
    }

    cout<<ans<<'\n';
    
    return 0;
}