80分求调

#include <bits/stdc++.h>
using namespace std;
int n;
struct p
{
	string s;
	int y,m,d,num;
}p[105];
bool cmp(struct p a,struct p b)
{
	return a.num <= b.num;
}
int main()
{
	cin >> n;
	for (int i = 1;i <= n;i++)
	{
		cin >> p[i].s >> p[i].y >> p[i].m >> p[i].d;
		p[i].num = p[i].y * 10000 + p[i].m * 100 + p[i].d;
	}
	sort(p + 1,p + n + 1,cmp);
	for (int i = 1;i <= n;i++)
	{
		cout << p[i].s << endl;
	}
	return 0;
}