Result: Accepted
Time: 4ms
Memory: 1760kB
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct Name{
char call[25];
int count;
}Name;
bool comp(const Name &a,const Name &b){
return a.count>b.count;
}
int main(){
int n,t,i,count;
char nametmp[25];
Name a[50];
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%s%d",nametmp,&count);
Name am;
strcpy(am.call,nametmp);
am.count=count;
a[i]=am;
}
sort(a,a+n,comp);
for(i=0;i<n;++i){
printf("%s\n",a[i].call);
}
}
return 0;
}