#include<iostream> #include<algorithm> using namespace std; struct Stu{int id,Chinese,maths,English; int sum(){ return Chinese+maths+English; } }; Stu st[301]; bool cmp(Stu a,Stu b){ if(a.sum()==b.sum()&&a.Chinese==b.Chinese){ return a.id<b.id; } if(a.sum()==b.sum()){ return a.Chinese>b.Chinese; } return a.sum()>b.sum(); } int main(){ int n,z,s,y; cin>>n; for(int i=0;i<n;i++){ cin>>z>>s>>y; st[i].id=i+1; st[i].Chinese=z; st[i].maths=s; st[i].English=y; } sort(st,st+n,cmp); for(int i=0;i<5;i++){ cout<<st[i].id<<" "<<st[i].sum()<<endl; } return 0; }