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
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

int main() {
    int n;
    cin >> n;
    map<int,int> numbers;
    for(int i = 0; i < n; i++) {
        int x;
        cin >> x;
        numbers[x]++;
    }

    vector<int> counts;
    for (auto const &[k, v]: numbers) {
        counts.push_back(v);
    }
    sort(counts.begin(), counts.end(), [](const int a, const int b) { return a > b; });

    int covered = 0;
    int result = 0;
    for (auto c: counts) {
        result += 1;
        covered += 2 * c - 1;
        if (covered >= n) {
            break;
        }
    }
    cout << result << '\n';
    return 0;
}