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

using namespace std;

#ifdef D
#define DEBUG(x)        \
    do {                \
        x               \
        cout.flush();   \
    } while (0)
#else
#define DEBUG(x)
#endif

using ll = long long;
using pii = pair<int, int>;

const int NMAX = 5e5 + 7;

int n, a, lsize, res;
int cnt[NMAX];
vector<int> quants;

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

    cin >> n;

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

    for (int i = 1; i <= n; ++i) {
        if (cnt[i] > 0) {
            quants.push_back(cnt[i]);
        }
    }

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

    int i = 0, j = quants.size() - 1;

    while (i <= j) {
        while (lsize + quants[i] < quants[j]) {
            lsize += quants[i];
            i++;
        }
        int diff = quants[j] - lsize - 1;
        quants[i] -= diff;
        res++;
        j--;
        lsize = 0;
    }

    cout << res << "\n";

    return 0;
}