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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
  	cin.tie(nullptr);
  	cout.tie(nullptr);
  	int n;
  	int num;
  	cin>>n;
  	int n_tmp=n;
  	vector<int> counts(n);
  	for(int i=0;i<n;++i)
  	{
  		cin>>num;
		counts[num-1]++;	
	}
	sort(counts.begin(),counts.end(),greater<int>());
	int groups=1;
	for(int i=0;i<n;++i)
	{
		if(counts[i]>n_tmp/2)
		{
			break;
		}
		else
		{
			groups++;
			n_tmp-=(counts[i]*2-1);
		}
	}
	cout<<groups<<'\n';
}