#include<stdio.h>
#include<stdlib.h>
#define a 50

	struct student{
		char n[100];
		int c;
	};
	int comp(const void *p,const void *q){
		return ((struct student *)q)->c-((struct student *)p)->c;
	}
	int main(void){
		struct student s[50];
		int i,w,k;
		scanf("%d",&w);
		while(w--)
		{
		scanf("%d",&k);
		   for(i=0;i<k;++i)
		   {
		   	scanf("%s %d",s[i].n,&s[i].c);
		   }
		   qsort(s,k,sizeof(struct student),comp);
		   for(i=0;i<k;++i)
		   printf("%s\n",s[i].n);
		}
	
	return 0;
}