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

using namespace std; 

int main() {

    int n;
    cin >> n;

    int t[500001] = {0,};

    for (int i; i<n; ++i) {
        int x;
        cin >> x;
        t[x]++;
    }

    sort(t, t + 500001, greater<int>());

    int r = 0;
    while (n > 0) {
        n -= t[r++]*2-1;
    }

    cout << r;

    return 0;
}