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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>

using namespace std;

#define st first
#define nd second
typedef long long ll;
typedef long double ld;
typedef __int128 int128;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<ll,ll> pl;

const int max_n = 5e5+7;

int arr[max_n];
vi v;

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        arr[x]++;
    }


    for(int i = 1; i <= n; i++)
        if(arr[i] != 0) v.push_back(arr[i]);

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

    int l = 0;
    int r = v.size()-1;

    int ans = 0;
    while(l <= r){
        int target = v[r];
        int sum = 0;
        while(l < r && sum < target-1){
            if(sum+v[l] < target){
                sum += v[l];
                l++;
            }
            else{
                v[l] -= target-sum-1;
                sum += target-sum-1;
            }
        }
        r--;
        ans++;
    }

    cout << ans;

    return 0;
}

//g++ -O3 -static -Wall .cpp -std=c++17