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: 5ms
Memory: 1500kB
Author: 2018212212167
In contest: 1284

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#define ARRAY_SIZE 50
struct loy {
	char name[10000];
	int num;
};
int main(void)
{
	struct loy loyArray[ARRAY_SIZE];
	struct loy Max;
	int i,n,t,j;
	int temp;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%s %d",loyArray[i].name,&loyArray[i].num);
		}
		for(i=0;i<n;i++)
		{
			for(j=0;j<n-i-1;j++)
			{
				if(loyArray[j].num<loyArray[j+1].num)
				{
					Max=loyArray[j];
					loyArray[j]=loyArray[j+1];
					loyArray[j+1]=Max;
				}
			}
		}
		for(i=0;i<n;i++)
		{
			printf("%s\n",loyArray[i].name);
		}
		
	}
}