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

using namespace std;
typedef long long ll;
const int MAXN = 5e5;

int cnt[MAXN+5];

void solve()
{
	int n;
	cin >> n;
	for(int i=0;i<n;i++){
		int a;
		cin >> a;
		cnt[a]++;
	}
	int m = n;
	int s = 0;
	int res = 1;
	vector<int> W;
	for(int i=1;i<=n;i++){
		if(!cnt[i]) continue;
		W.push_back(cnt[i]);
	}
	sort(W.begin(), W.end());
	for(int i=W.size()-1;i>=0;i--){
		int c = W[i];
		m -= c;
		s += c-1;
		if(s >= m){
			cout << res;
			return;
		}
		res++;
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	solve();
	
	return 0;
}