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;

unordered_map<int, int> mapp;
int n;
int tab[500005];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i=0;i<n;i++) {
        int a;
        cin >> a;
        if(mapp.find(a) != mapp.end()) {
            mapp[a]++;
        } else {
            mapp[a]=1;
        }
    }
    int siz = 0;
    for (auto& p: mapp) {
        tab[siz++] = p.second;
    }
    sort(tab, tab + siz);
    for(int i=siz-1;i>=0;i--) {
        int s = tab[i];
        n -= 2*s-1;
        if(n <= 0) {
            cout << siz-i;
            return 0;
        }
    }
    return 0;
}