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

vector<int> arr, v;

bool comp(int a, int b){
	return a > b;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	if(n == 1){
		cout << 1;
		return 0;
	}
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		arr.push_back(x);
	}
	sort(arr.begin(), arr.end());
	arr.push_back(-1);
	int ile = 1;
	for(int i = 1; i < arr.size(); i++){
		if(arr[i - 1] == arr[i]) ile++;
		else{
			v.push_back(ile);
			ile = 1;
		}
	}
	sort(v.begin(), v.end(), comp);
	int i = 0, j = v.size() - 1;
	while(i < j){
		v[i]--;
		while(v[i] >= v[j] && i < j){
			v[i] -= v[j];
			v[j--] = 0;
		}
		v[j] -= v[i];
		v[i] = 0;
		i++;
	}
	if(v[i] > 0) i++;
	cout << i;
	return 0;
}