咋测咋对，就是不过啊~~~

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
    string name;
    int y,m,d,number;
}a[105];
bool cmp0(node a,node b){
    return a.number > b.number;
}
bool cmp1(node a,node b){
    return a.d < b.d;
}
bool cmp2(node a,node b){
    return a.m < b.m;
}
bool cmp3(node a,node b){
    return a.y < b.y;
}
int main(){
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i].name >> a[i].y >> a[i].m >> a[i].d;
        a[i].number=i;
    }
    sort(a+1,a+n+1,cmp0);
    sort(a+1,a+n+1,cmp1);
    sort(a+1,a+n+1,cmp2);
    sort(a+1,a+n+1,cmp3);
    for(int i = 1; i<= n;i++){
        cout << a[i].name << endl;

    }

    return 0;
}