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

const int N = 5e5+5;
int A[N];
priority_queue <int> Q;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n;
	cin >> n;
	for (int i=0; i<n; i++)
	{
		int a;
		cin >> a;
		A[a]++;
	}
	
	for (int i=0; i<N-2; i++)
	{
		if (A[i] > 0) Q.push(A[i]);
	}
	
	int l = n, w=1;
	while (!Q.empty())
	{
		if (l <= 0) break;
		int a = Q.top();
		Q.pop();
		if (a > l/2) break;
		l -= (a + ceil(a/2));
		w++;
	}
    cout << w;
    
    return 0;
}