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


int main(){
    ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	int ile[n+1] = {0};
	for (int i = 0 ; i<n ; i++){
		int a;
		cin >> a;
		ile[a]++;
	}
	sort(ile+1,ile+n+1);
	int k = n;
	int p = 1;
	while (ile[p]==0) p++;
	int pom = 0;
	int w = 0;
	while (k>p){
		if (ile[k]==1){
			k--;
			w++;
		}else if (ile[k]-1>ile[p]-pom){
			ile[k]-=ile[p]-pom;
			p++;
			pom = 0;
		}else if (ile[k]-1==ile[p]-pom){
			p++;
			k--;
			w++;
			pom = 0;
		}else{
			pom=ile[k];
			k--;
			w++;
		}
	}
	if (k==p) cout << w+1 << '\n';
	else cout << w << '\n';
}