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 <algorithm>

using namespace std;

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

    int tab[500000] = {0};

    int num;
    for (int i = 0; i < n; i++) {
        cin >> num;
        tab[num]++;
    }

    // sort tab ascending order
    sort(tab, tab + 500000, greater<int>());

    int sum = 0;
    int res = 0;
    for (int i = 0; i <= n; i++) {
        res++;
        sum += 2 * tab[i] - 1;
        if (sum >= n) {
            cout << res << endl;
            return 0;
        }
    }

    return 0;
}