Result: Accepted
Time: 4ms
Memory: 1776kB
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
struct Arr{
char name[100];
int num;
}arr[150];
int t,n;
int cmp(const Arr &x, const Arr &y){
return x.num>y.num;
}
int main()
{
cin>>t;
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%s %d",arr[i].name,&arr[i].num);
}
sort(arr+1,arr+1+n,cmp);
for(int i=1;i<=n;i++){
printf("%s\n",arr[i].name);
}
}
}