通俗题解(已AC)

#include<stdio.h>
#include<algorithm>
using namespace std;

struct p{
	int c;
	int id;
	int s;
};

bool func(p a, p b){
	if(a.c==b.c&&a.s==b.s) return a.id<b.id;
	if(a.s==b.s) return a.c > b.c;
	return a.s > b.s;
}

int main(){
	int n, c, m, e;
	scanf("%d",&n);
	p pp[n];
	for(int i=0;i<n;i++){
		scanf("%d%d%d",&c,&m,&e);
		pp[i].id = i+1;
		pp[i].c = c;
		pp[i].s = c+m+e;
	}
	
	sort(pp, pp+n, func);
	for(int i=0;i<5;i++){
		printf("%d %d\n",pp[i].id, pp[i].s);
	}
	return 0;
}