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

using namespace std;

int main()
{
	int n;

	cin >> n;

	vector<int> a(n + 1, 0);

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

	vector<int> g(n + 1, 0);
	
	for (int i = 0; i <= n; i++)
		g[a[i]]++;

	int covered{0};
	int groups{0};

	for (int i = n; i > 0; i--)
	{
		while (g[i]>0)
		{
			g[i]--;
			covered += i + i - 1;
			groups++;
			if (covered >= n)
				break;
		}
		if (covered >= n)
			break;
	}
	cout << groups;

	return 0;
}