666

#include <iostream>
#include <algorithm>
using namespace std;
long long n;
struct node
{
	string name;
	int a,b,c,id;
	int sum;
	void in()
	{
		cin>>name>>a>>b>>c;
		sum=a+b+c;
	}
	void out()
	{
		cout<<name<<" "<<sum<<endl;
	}
}arr[1000005];
bool cmp(node a,node b)
{
	if(a.sum!=b.sum)return a.sum>b.sum;
    if(a.a!=b.a)return a.a>b.a;
    if(a.b!=b.b)return a.b>b.b;
    return a.id<b.id;
}
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		arr[i].in();
        arr[i].id=i+1;
	}
	sort(arr,arr+n,cmp);
	for(int i=0;i<n;i++)
	{
		arr[i].out();
	}
	
	return 0;
}


有帮助，赞一个

userId_undefined