BestCoder Round #54 (div.2) HDU5427 A problem of sorting

A problem of sorting

                                                               Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                          Total Submission(s): 1052    Accepted Submission(s): 441

Problem Description

There are many people's name and birth in a list.Your task is to print the name from young to old.(There is no pair of two has the same age.)

 

Input

First line contains a single integer  T≤100  which denotes the number of test cases. 

For each test case, there is an positive integer  n(1≤n≤100)  which denotes the number of people,and next  n  lines,each line has a name and a birth's year(1900-2015) separated by one space.

The length of name is positive and not larger than  100 .Notice name only contain letter(s),digit(s) and space(s).

 

Output

For each case, output  n  lines.

 

Sample Input

  
  

   
   2
1
FancyCoder 1996
2
FancyCoder 1996
xyz111 1997
  
  

 

Sample Output

  
  

   
   FancyCoder
xyz111
FancyCoder
  
  

 

Source

BestCoder Round #54 (div.2)

出题人：选择任意喜欢的排序方法即可。注意名字中可能有空格。

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
using namespace std;
int main()
{
    int a[200];
    char b[200];
    int n,t,k,i,j,len;
    char bb[200][200];
    scanf("%d",&t);
    while(t--)
    {
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        getchar();
        j=0;
        for(i=0;i
      
      
       
       =0;i--)
        {
            if(a[i])
            {
                for(j=0;bb[i][j]!='\0';j++)
                {
                    printf("%c",bb[i][j]);
                }
                printf("\n");
            }
        }
    }
    return 0;
}