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
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;

void solve(){
	int n;
	cin>>n;
	vector<int>cnt(n,0);
	for(int i=0,x;i<n;++i){
		cin>>x;
		++cnt[--x];
	}
	set<pi>S;
	for(int i=0;i<n;++i)
		if(cnt[i])
			S.insert(pi(cnt[i],i));
	int ret=0;
	while(!S.empty()){
		++ret;	
		auto cur=*prev(S.end());
		S.erase(prev(S.end()));
		int left=cur.first-1;
		while(left and !S.empty()){
			auto cur2=*S.begin();
			S.erase(S.begin());
			int now=min(left,cur2.first);
			left-=now;
			cur2.first-=now;
			if(cur2.first)S.insert(cur2);
		}
	}
	cout<<ret<<'\n';
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t=1;
	//cin>>t;
	while(t--)
		solve();
}