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

const int maxn = 5e5+7;

int a[maxn];
int cnt[maxn];
vector<int> sorted;
vector<bool> deleted;
int main()
{
	ios_base::sync_with_stdio(0);
	
	cin.tie(0);

	int n;
	cin >> n;
	
	
	for(int i=1;i<=n;++i)
	{
		cin >> a[i];
		cnt[a[i]]++;
		
		
	}
	for(int i=1;i<=n;++i)
	{
		
		if(cnt[i]>0)
		{
			sorted.push_back(cnt[i]);
			
			
		}
	}
	
	sort(sorted.begin(),sorted.end());
	

	int ans = 0;
int l = 0;
int r = sorted.size()-1;
if(n==1)
{
	cout << 1 << "\n";
	return 0;
}
	
while(l<=r)
{
	++ans;
	int tmp = 0;
	while(l<r and tmp+sorted[l]<sorted[r])
	{
		tmp+=sorted[l];
		++l;
		
	}
	r--;
	
}
	cout << ans;
	return 0;
}