原始人题解

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long n,z,p,m,q=0,max=-1,max1=-1,max2=-1;
    cin>>n;
    vector<int> a(n);
    vector<int> b(n);
    vector<int> c(n);
    for(int i=0;i<n;i++){
        cin>>z>>p>>m;
        a[i]=z+p+m;
        b[i]=z;
        q++;
        c[i]=q;
    }
    for(int o=0;o<5;o++){
        for(int i=0;i<n;i++){
            if(max<a[i]){
                max=a[i];
                max1=b[i];
                max2=c[i];
            }else if(max==a[i]&&b[i]>max1){
                max=a[i];
                max1=b[i];
                max2=c[i];
            }else if(max==a[i]&&b[i]==max1&&c[i]<max2){
                max=a[i];
                max1=b[i];
                max2=c[i];
            }
        }
        cout<<max2<<" "<<max<<endl;
        for(int i=0;i<n;i++){
            if(a[i]==max&&b[i]==max1&&c[i]==max2){
                a[i]=-1;
            }
        }
        max=-1;
    }
    return 0;
}