80pts，WA最后一个

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