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 <iostream>
#include <algorithm>
#include <vector>
#include <limits>
#include <map>
#include <queue>

using namespace std;
using num = int;

priority_queue<num> q;
map<num, num> m;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	num n;
	cin >> n;
	for (num i = 0; i < n; ++i)
	{
		num x;
		cin >> x;
		++m[x];
	}
	for (auto it : m)
	{
		q.push(it.second);
	}
	num sum = 0;
	num odp = 0;
	while (sum < n)
	{
		sum += q.top() * 2 - 1;
		q.pop();
		++odp;
	}
	cout << odp;
	return 0;
}