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
39
40
41
42
43
44
45
46
47
48
#include <bits/stdc++.h>

using namespace std;

vector<int> nums, sizes;

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

    int a;
    for(int i = 0; i<n; i++){
        cin>>a;
        nums.push_back(a);
    }

    sort(nums.begin(), nums.end());

    int ln = nums[0];
    int cnt = 1;
    for(int i = 1; i<n; i++){
        if(nums[i] == ln){
            cnt++;
            continue;
        }
        sizes.push_back(cnt);
        cnt = 1;
        ln = nums[i];
    }
    sizes.push_back(cnt);

    sort(sizes.rbegin(), sizes.rend());

    int poss = 0;
    int out = 0;
    for(int cnt : sizes){
        out++;
        poss += cnt + cnt-1;
        if(poss>=n){
            cout<<out;
            return 0;
        }
    }
    return 0;
}