Result: Accepted
Time: 5ms
Memory: 2020kB
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<string>
#include<functional>
#include<stdio.h>
using namespace std;
class loy{
public:
friend istream &operator>>(istream &in,loy &l);
friend ostream &operator<<(ostream &out,loy &l);
string name;
int n;
};
istream &operator>>(istream &in,loy &l){
in>>l.name>>l.n;
return in;
}
ostream &operator<<(ostream &out,loy &l){
out<<l.name<<endl;
return out;
}
int main()
{
/*double T;
int a[1100];
a[0]=2;
a[1]=3;
for(int i=2;i<1100;i++){
a[i]=a[i-1]+a[i-2];
}
while(scanf("%d",&T)!=EOF){
for(int i=0;i<1100;i++){
if(T==a[i]){
printf("Lucky Day\n");
break;
}
else if(a[i]>T){
printf("Bad Day\n");
break;
}
}
}*/
int T,n;
loy l[110],temp;
cin>>T;
while(T--){
cin>>n;
for(int i=0;i<n;i++){
cin>>l[i];
}
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(l[i].n>l[j].n){
temp.n=l[i].n;l[i].n=l[j].n;l[j].n=temp.n;
temp.name=l[i].name;l[i].name=l[j].name;l[j].name=temp.name;
}
}
}
for(int i=0;i<n;i++)
cout<<l[i];
}
//system("pause");
return 0;
}