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
#include <iostream>
#include <algorithm>
using namespace std;

const int M = 500005;
int n, c[M], a, res;

int32_t main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a;
		c[a]++;
	}
	sort(c, c + n + 1);
	int l = 0, r = n;
	while (c[l] == 0)
		l++;
	while (l <= r) {
		res++;
		int cur = c[r] - 1;
		while (1)
			if (cur >= c[l])
				cur -= c[l++];
			else {
				c[l] -= cur;
				break;
			}
		r--;
	}
	cout << res;
}