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
#include <algorithm>
#include <cstdio>
#include <functional>
#include <vector>

using namespace std;

int main() {
    int n, maxa = 0;
    scanf("%d", &n);
    vector<int> counters(n + 1, 0);
    for(int i = 0, a; i < n; i++) {
        scanf("%d", &a);
        counters[a]++;
        maxa = max(a, maxa);
    }
    vector<int> summary; 
    for(int i = 1; i <= maxa; i++) {
        if (counters[i]) {
            summary.push_back(counters[i]);
        }
    }
    sort(summary.begin(), summary.end(), greater<int>());
    int sum = 0;
    for (int i = 0; i < summary.size(); i++) {
        sum += 2*summary[i] - 1;
        if (sum >= n) {
            printf("%d", i+1);
            break;
        }
    }
    return 0;
}