30分求改必关注

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
    int c,m,e,z,num;
}a[10001];
int m[10001];
bool cmp(node a,node b){
    if(a.z!=b.z){
        return a.z>b.z;
    }else{
        if(a.c+a.m!=b.c+b.m){
            return a.c+a.m>b.c+b.m;
        }else{
            if(max(a.c,a.m)!=max(b.c,b.m)){
                return max(a.c,a.m)>max(b.c,b.m);
            }else{
                return 0;
            }
        }
    }
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].c>>a[i].m>>a[i].e;
        a[i].num=i;
        a[i].z=a[i].c+a[i].e+a[i].m;
    }
    sort(a+1,a+1+n,cmp);
    int zj=0;
    int zf=-999,cmzf=-999,cmmax=-999;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[j].num==i){
                if(a[j].z==zf&&a[j].c+a[j].m==cmzf&&max(a[j].c,a[j].m)==cmmax){
                    zj++;
                    cout<<j-zj<<endl;
                }else{
                    zf=a[j].z;
                    cmzf=a[j].c+a[j].m;
                    cmmax=max(a[j].c,a[j].m);
                    cout<<j<<endl;
                }
            }
        }
    }
    return 0;
}