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
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>


using namespace std;


int solve(int n, vector <int> &a) {
    vector <int> cnt(n, 0);
    for (int ai : a) {
        cnt[ai]++;
    }

    vector <int> withCnt(n + 1, 0);
    for (int i = 0; i < n; i++) {
        withCnt[cnt[i]]++;
    }

    int ans = 0, sum = 0;
    for (int c = n; c >= 0; c--) {
        for (int i = 1; i <= withCnt[c]; i++) {
            ans++;
            sum += c;

            if (2 * sum >= n + ans) {
                return ans;
            }
        }
    }

    assert(false);
}

int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <int> a(n);
    for (int &ai : a) {
        cin >> ai; ai--;
    }

    cout << solve(n, a);

    return 0;
}