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

using namespace std;

typedef long long ll;

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

    int n;
    cin >> n;

    int a;
    int l[n];
    for (int i = 0; i < n; i++) {
        l[i] = 0;
    }
    for (int i = 0; i < n; i++) {
        cin >> a;
        l[a - 1]++;
    }

    sort(l, l + n);

    int res = 1;
    int sum = 2 * l[n - res] - 1;
    while (sum < n) {
        res++;
        sum += 2 * l[n - res] - 1;
    }

    cout << res << "\n";
    
    return 0;
}