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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

	vector<int> counts(n + 1);

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

	sort(counts.begin(), counts.end(), greater<int>());
	int b = 0, e = n;
	while (b < e) {
        int sum{};
		while (sum + counts[e] < counts[b]) {
			sum += counts[e--];
		}
		counts[e] -= (counts[b] - sum - 1);
        b++;
	}

	cout << b + (b == e);
}