84分求调

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct birthday
{
	string name,year,month,day;
};
string buling(string s,int a) {
    if (s.length() >= a) return s;
    string ans="";
    for(int i = 0; i < a - s.length();i++) ans += "0";
    return ans + s;
}
bool cmp(birthday a,birthday b)
{
	a.year=buling(a.year,4);
	a.month=buling(a.month,2);
	a.day=buling(a.day,2);
	b.year=buling(b.year,4);
	b.month=buling(b.month,2);
	b.day=buling(b.day,2);
	return a.year+a.month+a.day>b.year+b.month+b.day;
}
int main()
{
	birthday a[101];
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i].name>>a[i].year>>a[i].month>>a[i].day;
	}
	sort(a,a+n,cmp);
	for(int i=n-1;i>=0;i--)
	{
		cout<<a[i].name<<endl;
	}
	return 0;
}