Start: Jul, 10, 2019 08:30:00
2019年度暑期短学期达标测试补考
End: Jul, 10, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: H
Result: Accepted
Time: 3ms
Memory: 1120kB
Author: 2018212212202
In contest: 1284

#include<stdio.h>
struct Loy
{
	char name[21];
	int count;
};
int main()
{
	int t,n,i,j;
	struct Loy LoyArray[100];
	struct Loy max;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%s%d",LoyArray[i].name,&LoyArray[i].count);
		}
		for(i=1;i<n;i++)
		{
			for(j=0;j<n-i;j++)
			{
				if(LoyArray[j+1].count>LoyArray[j].count)
				{
					max=LoyArray[j+1];
					LoyArray[j+1]=LoyArray[j];
					LoyArray[j]=max;
				}
			}
		}
		for(i=0;i<n;i++)
		{
			printf("%s\n",LoyArray[i].name);
		}
	}
	return 0;
}