建议降红
查看原帖
建议降红
390151
Monody_qx楼主2024/10/26 22:14
#include <bits/stdc++.h>
using namespace std;
long long tong[100005];
long long number[100005];
long long cnt;
long long t;
long long maxx=-1,minn=20000000;
int main()
{
	scanf("%lld",&t);
	for(int i=1;i<=t;i++)
	{
		scanf("%lld",&number[i]);
		tong[number[i]]++;
		minn=min(minn,number[i]);
		maxx=max(maxx,number[i]);
	}
	long long bef=tong[minn];
	for(int i=minn+1;i<=maxx;i++)
	{
		if(tong[i]>0)
		{
			if(bef>tong[i])	
				t-=tong[i];
			else 
			{
				t-=bef;
				bef=tong[i];
			}
		}
	}
	cout<<t;
}
2024/10/26 22:14
加载中...