# include<iostream> # include<algorithm> using namespace std; struct Student{ int id; int Ch; int Ma; int En; void input(){ cin>>Ch>>Ma>>En; } int zf(){ return Ch+Ma+En; } }; Student s[101]; bool cmp(Student a,Student b){ if(a.zf()!=b.zf())return a.zf()>b.zf(); if(a.zf()==b.zf() && a.Ch!=b.Ch)return a.Ch>b.Ch; if(a.zf()==b.zf() && a.Ch==b.Ch)return a.id>b.id; } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ s[i].id=i; cin>>s[i].Ch>>s[i].Ma>>s[i].En; } sort(s+1,s+n+1,cmp); for(int i=1;i<=5;i++){ cout<<s[i].id<<" "<<s[i].zf()<<endl; } return 0; }