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
61
#include <cstdio>
#include <algorithm>
#include <map>
#include <vector>

using namespace std;



int main()
{
	int n;
	scanf("%d", &n);

	int* s = new int[n+1];
	for (int i = 0; i <= n; i++)
	{
		s[i] = 0;
	}

	for (int i = 0; i < n; i++)
	{
		int a;
		scanf("%d", &a);
		s[a]++;
	}

	vector<int> ope;
	for (int i = 0; i <= n; i++)
	{
		if (s[i] > 0)
		{
			ope.push_back(s[i]);
		}
	}

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

	int res = 0;
	int l = 0, p = ope.size() - 1;
	while (l <= p)
	{
		res++;
		int sum = 0;
		while (l < p && sum + ope[l] < ope[p])
		{
			sum += ope[l];
			l++;
		}

		ope[p] -= sum;
		ope[p]--;
		ope[l] -= ope[p];
		p--;

	}

	printf("%d", res);

	return 0;
}