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

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	cin >> n;
	vector<int> cnt(n);
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		cnt[a - 1]++;
	}
	sort(cnt.begin(), cnt.end(), greater<int>());
	
	int result = 0;
	for (int l = 0, r = n - 1; l <= r; l++) {
		int cur = 0;
		while (cur + cnt[r] < cnt[l]) {
			cur += cnt[r];
			cnt[r] = 0;
			r--;
		}
		if (r > l) {
			int add = cnt[l] - cur - 1;
			cur += add;
			cnt[r] -= add;
		}
		cnt[l] = 0;
		result++;
	}
	cout << result << "\n";
	
	return 0;
}