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
#include<bits/stdc++.h>
#define first x
#define second y
#define MAXN 500311

using namespace std;

int n, t, w;
int cups[MAXN];

int main() {
	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	w = 0;
	cin >> n;
	
	for (int i = 0; i < MAXN; i++) {
		cups[i] = 0;
	}

	for (int i = 0; i < n; i++) {
		cin >> t;
		cups[t]++;
	}

	sort(cups, cups + MAXN);

	for (int i = MAXN - 1; i >= 0; i--) {
		if(n <= 0) {
			break;
		}
		w++;
		n -= 2 * cups[i] - 1;
	}
	
	cout<<w<<"\n";
	
	return 0;
}