#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
typedef struct Team{
int ID;
int M;
}Team;
bool cmp(const Team&a,const Team&b){
return a.M>b.M;
}
int main(){
Team Tm[10000];
int T,N;
int i,j;
cin>>T;
while(T--){
cin>>N;
for(i=0;i<N;i++)
cin>>Tm[i].ID>>Tm[i].M;
stable_sort(Tm,Tm+N,cmp);
for(i=0;i<N;i++)
cout<<Tm[i].ID<<" "<<Tm[i].M<<endl;
}
return 0;
}
/***************************************************
User name: TJRAC6015203228魏杰
Result: Accepted
Take time: 20ms
Take Memory: 176KB
Submit time: 2016-10-27 22:39:54
****************************************************/
sdut2446最终排名
最新推荐文章于 2020-06-02 15:38:18 发布