code:
#include<bits/stdc++.h>
using namespace std;
struct node{
int y,s,w,all,ys;
};
const int N=1e4+10;
int main(){
int n,j[N],yu[N];
node a[N];
cin>>n;
for(int i=1,c,m,e;i<=n;i++){
cin>>c>>m>>e;
a[i].y=c;
a[i].s=m;
a[i].w=e;
a[i].all=c+m+e;
a[i].ys=c+m;
}int mingci =1;
for(int i=1;i<=n;i++,mingci++){
int maxn=-1,biao,tin;
bool sec=0;
for(int j=1,cnt=0;j<=n;j++,tin=0){
if(a[j].all>maxn){
cnt=1;
biao=j;
}
}for(int j=1;j<=n;j++,tin=0){
if(a[j].all==maxn){
if(a[j].ys>a[biao].ys){
biao=j;
}else if(a[j].ys==a[biao].ys){
if(max(a[j].y,a[j].s)>max(a[biao].y,a[biao].s)){
biao=j;
}else if(max(a[j].y,a[j].s)==max(a[biao].y,a[biao].s)){
sec=1;
j[biao]=mingci;
biao=j;
tin++;
}
}
}
}
j[biao]=mingci;
mingci+=tin;
}
for(int i=1;i<=n;i++){
cout<<j[i]<<" ";
}
return 0;
}
36行报错,报错反馈:“invalid types 'int[int]' for array subscript”