大佬指点，赏1关

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;

struct ren{
	string name;
	int y,m,d,id;
}r[maxn];
bool cmp(ren a,ren b){
	if(a.y!=b.y){
		return a.y<b.y;
	}else{
		if(a.m!=b.m){
			return a.m<b.m;
		}else{
			if(a.d!=b.d) return a.d<b.d;
			else{
				return a.id>b.id;
			}
		}
	}
}
int main(){
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> r[i].name >> r[i].y >> r[i].m >> r[i].d;
	}
 	stable_sort(r+1,r+1+n,cmp);
	for(int i=1;i<=n;i++){
		cout << r[i].name << "\n";
	}
	return 0;
}