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

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	map<int, int> count;
	int a;
	for(int i = 0; i < n; i++) {
		cin >> a;
		count[a]++;
	}
	int m = 0;
	int i = 0;
	vector<int> counts;
	for(auto& [_, v]: count) {
		counts.push_back(v);
	}
	sort(counts.begin(), counts.end(), greater<int>());
	for(auto& v: counts) {
		m += 2 * v - 1;
		i++;
		if (m >= n) {
			cout << i << "\n";
			return 0;
		}
	}
}