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
#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 1e6 + 7;
int cnt[MAXN];
int n;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	
	for(int i = 1; i <= n; i++){
		int a;
		cin >> a;
		cnt[a]++;
	}
	
	priority_queue<int> Q;
	for(int i = 1; i <= n; i++){
		if(cnt[i]) Q.push(cnt[i]);
	}
		
	int seq = 0;
	int act = n;
	
	while(act > 0 && Q.size()){
		seq++;
		act -= 2*(Q.top());
		act += 1;
		Q.pop();
	}
	
	cout << seq << "\n";
}