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

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n;
	cin >> n;
	int tab[n];
	for(int i = 0; i < n; i++){
		cin >> tab[i];
	}
	sort(tab, tab+n);
	int il = 1;
	vector<int> v;
	for(int i = 1; i < n; i++){
		if(tab[i] == tab[i-1]){
			il++;
		}else{
			v.push_back(il);
			il = 1;
		}
	}
	v.push_back(il);
	sort(v.rbegin(), v.rend());
	int left = n, now = 0, wynik = 0;
	for(auto& i : v){
		left -= i;
		now += i-1;
		wynik++;
		if(now >= left) break;
	}
	cout << wynik;
	return 0;
}