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

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> a(n+1, 0);

    for (int i = 0; i <n ; ++i) {
        int tmp;
        cin >> tmp;
        a[tmp]++;

    }


    sort(a.begin(), a.end(), greater<int>());

    int res = 0;

    if (n == 1) {
        cout << 1 << "\n";
        return 0;
    }

    int remaining = n;

    for (int i = 0; i < n+1 && remaining > 0; ++i) {
        remaining -= (a[i] + (a[i] - 1));
        res++;
    }

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

}