ACGO首AC的GO

#include<iostream>
#include<algorithm>
using namespace std;
struct student{
    string name;
    int y,m,d;
    int birth;
    int id;
}st[100];
bool cmp(student a,student b){
    if(a.birth==b.birth)return a.id>b.id;
    return a.birth<b.birth;
}
int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
        cin>>st[i].name>>st[i].y>>st[i].m>>st[i].d;
        st[i].id=i,st[i].birth=st[i].y*10000+st[i].m*100+st[i].d;
    }
    sort(st,st+t,cmp);
    for(int i=0;i<t;i++)cout<<st[i].name<<endl;
    return 0;
}