45pts,大佬救救
查看原帖
45pts,大佬救救
1035561
guoziqi201010楼主2024/10/16 22:31
#include<bits/stdc++.h>
using namespace std;
int n,a[200100],b[200100],c[200100];
int g[200100],s[200100],br[200100];
bool cmp(int a,int b)
{
	return a>b;
}
int pm(int x,int y)
{
	sort(g,g+n,cmp);
	sort(s,s+n,cmp);
	sort(br,br+n,cmp);
	if(y==1)
	{
		for(int i=0;i<n;i++)
		{
			if(x==g[i])
			{
				return i;
			}
		}
	}
		if(y==2)
	{
		for(int i=0;i<n;i++)
		{
			if(x==s[i])
			{
				return i;
			}
		}
	}
		if(y==3)
	{
		for(int i=0;i<n;i++)
		{
			if(x==br[i])
			{
				return i;
			}
		}
	}
}
int main()
{
	//freopen("medal.in","r",stdin);
	//freopen("medal.out","w",stdout);
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i]>>b[i]>>c[i];
	}
	for(int i=0;i<n;i++)
	{
		g[i]=a[i];
		s[i]=b[i];
		br[i]=c[i];
	}
	for(int i=0;i<n;i++)
	{
		int tmp1=pm(a[i],1);
		int tmp2=pm(b[i],2);
		int tmp3=pm(c[i],3);
		int minn=tmp1;
		if(tmp2<minn)
		{
			minn=tmp2;
		}
		if(tmp3<minn)
		{
			minn=tmp3;
		}
		cout<<minn+1<<endl;
		//cout<<min(pm(a[i],1),pm(b[i],2),pm(c[i],3))+1<<endl;
	}
	return 0;
}

帮忙看看哪里错了,玄关

2024/10/16 22:31
加载中...