代码如下

#include<bits/stdc++.h>
using namespace std;
struct student{
int id,x,y;
}a[1005];
bool cmp(student i,student j){
if(i.y!=j.y) return i.y>j.y;
else if(i.x!=j.x) return i.x>j.x;
else return i.id<j.id;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].id>>a[i].x>>a[i].y;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
cout<<a[i].id<<endl;
}
return 0;
}