Codeforces Round #702 (Div. 3) F. Equalize the Array(思维，前缀和，后缀和)

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=2*1e5+5;//空间最大限制 4e8
unordered_map < int , int > v,a,mp;
int n;
int b[N],sum[N],pre[N];
int s1[N],p1[N];
void init()
{
	a.clear();
	v.clear();
	mp.clear();
	memset(sum,0,sizeof(sum));
	memset(pre,0,sizeof(pre));
	memset(p1,0,sizeof(p1));
}
signed main()
{
//	ios::sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--)
	{
		int ma=0,ans=1<<30;
		init();
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&b[i]);
			a[b[i]]++;
			ma=max(ma,a[b[i]]);
		}
		for(int i=1;i<=n;i++)
		{
			if(mp[b[i]])  continue;
			mp[b[i]]=1;
			v[a[b[i]]]++;
		}
		for(int i=0;i<=ma;i++)  sum[i]=sum[i-1]+v[i]*i;
		for(int i=ma;i>=0;i--)  pre[i]=pre[i+1]+v[i]*i;
		for(int i=ma;i>=0;i--)  p1[i]=p1[i+1]+v[i];
		for(int i=1;i<=ma;i++)  ans=min(ans,sum[i-1]+(pre[i+1]-p1[i+1]*i));
		printf("%d\n",ans);
	}
    return 0;
}