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
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;
	vector<int> v(n);
	REP(i, n)
		cin >> v[i];
	debug(n, v);
	sort(v.begin(), v.end());
	vector<int> cnt;
	REP(i, n) {
		int x = i + 1;
		while (x < n and v[x] == v[i])
			++x;
		cnt.emplace_back(x - i);
		i = x - 1;
	}
	sort(cnt.rbegin(), cnt.rend());
	debug(cnt);

	int capacity = 0, other_elems = n;
	REP(i, ssize(cnt)) {
		const int x = cnt[i];
		capacity += x - 1;
		other_elems -= x;
		debug(i, x, capacity, other_elems);
		if (capacity >= other_elems) {
			cout << i + 1 << '\n';
			return 0;
		}
	}
	assert(false);
}