叒被㵘题切了
查看原帖
叒被㵘题切了
717476
Gaochenxi103_QWQ楼主2024/5/13 22:36
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10;
struct S{
	int Chinese,Maths,English,ans,id;
}lis[N]; 
int n;
bool cmp(S x,S y)
{
	if((x.Chinese+x.English+x.Maths)==(y.Chinese+y.English+y.Maths))
	{
		if((x.Chinese+x.Maths)==(y.Chinese+y.Maths))
		{
			return max(x.Chinese,x.Maths)>max(y.Chinese,y.Maths);
		}
		return (x.Chinese+x.Maths)>(y.Chinese+y.Maths);
	}
	return (x.Chinese+x.English+x.Maths)>(y.Chinese+y.English+y.Maths);
}
bool cmp2(S x,S y)
{
	return x.id<y.id;
}
signed main() {
	ios::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>lis[i].Chinese>>lis[i].Maths>>lis[i].English;
		lis[i].id=i;
	}
	sort(lis+1,lis+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		S x=lis[i],y=lis[i-1];
		if(max(x.Chinese,x.Maths)==max(y.Chinese,y.Maths))
		{
			lis[i].ans=lis[i-1].ans;
		}
		else
		{
			lis[i].ans=i;
		}
	}
	sort(lis+1,lis+n+1,cmp2);
	for(int i=1;i<=n;i++)
	{
		cout<<lis[i].ans<<"\n";
	}
	return 0;
}


2024/5/13 22:36
加载中...