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
// Jan Zakrzewski
#include <bits/stdc++.h>
using namespace std;

int constexpr N = 543'210;

int n;
int C[N];

int answer;
int cover;

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

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

    sort(&C[1], &C[n] + 1);

    answer = 0;
    cover = 0;
    for(int i = n; i >= 1; --i) {
        ++answer;
        cover += 2 * C[i] - 1;
        if(cover >= n) break;
    }

    cout << answer << "\n";

    return 0;
}