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

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	cin >> n;
	vector <int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	vector <pair <int, int> > w;
	int ile = 0;
	for (int i = 0; i < n; i++) {
		if (i && v[i] != v[i-1]) {
			w.push_back({ile, v[i-1]});
			ile = 0;
		}
		ile++;
	}
	w.push_back({ile, v[n-1]});
	int left = n;
	sort(w.rbegin(), w.rend());
	for (int i = 0; i < n; i++) {
		left -= w[i].ff;
		left -= (w[i].ff - 1);
		if (left <= 0) {
			cout << i+1 << "\n";
			return 0;
		}
	}
}