求条，悬正无穷关

#include<bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int fufu;
unsigned long long qzh[100005];
int maxn;
int minn=100006;
int ans;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>fufu;
		if(fufu>maxn)maxn=fufu;
		if(fufu<minn)minn=fufu;
		a[fufu]++;
	}
	for(int i=minn;i<=maxn;i++)
	{
		qzh[i]=qzh[i-1]+a[i];
		//cout<<qzh[i]<<" ";
	}
	for(int i=minn;i<=maxn;i++)
	{
		int aaa=qzh[maxn]-qzh[i];
		if(aaa<a[i])ans+=a[i]-aaa;

	} 

	cout<<ans;
	return 0;
}