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
#include<bits/stdc++.h>

using namespace std;

const int maxn = 5e5 + 7;
vector<int> ile(maxn);

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n; cin >> n;
    for(int i = 0; i < n; i++){
        int a; cin >> a;
        ile[a]++;
    }
    vector<int> q;
    for(int i = 1; i <= n; i++) q.push_back(ile[i]);
    sort(q.begin(), q.end());
    int res = 0;
    int i = q.size() - 1, j = 0;
    while(i >= j){
        if(i == j){
            res++;
            i--;
            j++;
        }
        else{
            res++;
            int sajz = q[i];
            while(2*q[i] > sajz + q[j] && i > j){
                sajz += q[j];
                j++;
            }
            if(i > j) q[j] -= (2*q[i] - sajz - 1);
            if(q[j] == 0) j++;
            i--;
        }
    }
    cout << res <<"\n";
}