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

#define pb push_back
#define st first
#define nd second

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

int main()
{
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<ll> v(n), cnt(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        cnt[v[i]]++;
    }

    vector<pll> pairs;
    for (int i = 0; i <= n; ++i) {
        if (cnt[i] > 0) pairs.pb({ cnt[i], i });
    }

   sort(pairs.begin(), pairs.end());
   int result = 0;
   int start = 0;

   while (start < pairs.size()) {
        pll last = pairs.back();

        ll val = 0;
        int i = start;

        while (i < pairs.size() && 0 < last.st - val) {
            if (pairs[i].st + val >= last.st) {
                pairs[i].st -= last.st - val - 1;
                break;
            }
            val += pairs[i].st;
            i++;
        }

        result++;
        pairs.pop_back();
        start = i;
   }

    cout << result << endl;
}