题解(内存特别少)

#include<bits/stdc++.h>
using namespace std;
struct Node{
	string name;
	int nian;
	int hao;
};
Node bs[205];
int n,b,c;
string a;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a>>b>>c;
		bs[i].name=a;
		if(b>60)
			bs[i].nian=2;
		else
			bs[i].nian=1;
		bs[i].hao=c;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=2;j<=n;j++)
		{
			if(bs[j-1].nian<bs[j].nian)
			{
				swap(bs[j-1].name,bs[j].name);
				swap(bs[j-1].nian,bs[j].nian);
				swap(bs[j-1].hao,bs[j].hao);
			}
			else if(bs[j-1].nian==bs[j].nian)
			{
				if(bs[j-1].hao>bs[j].hao)
				{
					swap(bs[j-1].name,bs[j].name);
					swap(bs[j-1].nian,bs[j].nian);
					swap(bs[j-1].hao,bs[j].hao);
				}
			}
		}
	}
	for(int i=1;i<=n;i++)
		cout<<bs[i].name<<"\n";
	return 0;
}