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

using namespace std;

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

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

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

    for(int i = 0; i <= n; ++i)
        if(data[i] > 0)data2.push_back(data[i]);
    
    sort(data2.begin(), data2.end());
    reverse(data2.begin(), data2.end());

    int sum = 0;
    int ans = 0;
    for(int i : data2){
        sum += (2*i - 1);
        ++ans;
        if(sum >= n)break;
    }

    cout << ans << '\n';

    return 0;
}