题解

#include <bits/stdc++.h>
using namespace std;
struct node{
    string s;
    int y,m,d,id;
}a[100005];
bool cmp(node x,node y){
    if(x.y!=y.y) return x.y<y.y;
    if(x.m!=y.m) return x.m<y.m;
    if(x.d!=y.d) return x.d<y.d;
    return x.id>y.id;
}
int main(){
    long long n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>a[i].s>>a[i].y>>a[i].m>>a[i].d,a[i].id=i+1;
    sort(a,a+n,cmp);
    for(int i=0;i<n;i++) cout<<a[i].s<<endl;
    return 0;
}