PE的烦恼

#include<iostream>
#include<algorithm>
using namespace std;
struct student{
    string i1;
    int i2,i3;
};
bool cmp(student a,student b){
    if(a.i2!=b.i2)return a.i2>b.i2;
    if(a.i3!=b.i3)return a.i3<b.i3;
    return a.i1>b.i1;
}
int main(){
    int n;
    cin>>n;
    student s[n];
    for(int i=0;i<n;i++)cin>>s[i].i1>>s[i].i2>>s[i].i3;
    sort(s,s+n,cmp);
    for(int i=0;i<n;i++)cout<<s[i].i1<<(i!=n-1?"\n":"");
    return 0;
}/*
4
a 1 2
b 1 2
c 1 2

c
b
a

c
b
a
*/