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

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);

	int n;
	cin >> n;
	vector<int> v(n), cnt(n);
	for (auto &e : v)
	{
		cin >> e;
		cnt[e-1]++;
	}
	sort(cnt.begin(), cnt.end());
	int ans = 0;
	int beg = 0;
	for (int i = n-1; i >= 0; i--)
	{
		if (cnt[i] > 0)
		{
			ans++;
			int k = cnt[i]-1;
			cnt[i] = 0;
			while (k--)
			{
				while (beg < n && cnt[beg] <= 0)
					beg++;
				if (beg < n)
					cnt[beg]--;
			}
		}
	}
	cout << ans << "\n";
}