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
43
44
45
46
47
48
49
50
51
// PA 2024 1B - Liderzy
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(0);
	vector<int> howManyRaw;
	vector<int> howMany;
	int n;
	int a;
	int numbersLeft;
	int result;
	
	cin >> n;
	
	for (int i = 0; i < n; ++i) {
		howManyRaw.push_back(0);
	}
	
	for (int i = 0; i < n; ++i) {
		cin >> a;
		++howManyRaw[a - 1];
	}
	
	for (int i = 0; i < n; ++i) {
		if (howManyRaw[i] > 0) {
			howMany.push_back(howManyRaw[i]);
		}
	}
	
	sort(howMany.begin(), howMany.end(), greater<int>());
	numbersLeft = n;
	result = 0;
	
	for (unsigned i = 0; i < howMany.size(); ++i) {
		if (numbersLeft <= 0) {
			break;
		}
		
		++result;
		numbersLeft -= 2 * howMany[i] - 1;
	}
	
	cout << result << endl;
	
	return 0;
}