hdu 5427(排序水题)

排序 年轻的排前面 名字中可能有空格

Sample Input
2
1
FancyCoder 1996
2
FancyCoder 1996
xyz111 1997

Sample Output
FancyCoder
xyz111
FancyCoder

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <algorithm>
 # include <string>
 # include <cmath>
 # include <queue>
 # define LL long long
 using namespace std ;

 struct ren
 {
     char name[] ;
     int age ;
 }a[];

 bool cmp(ren x , ren y)
 {
     return x.age > y.age ;
 }

 int main ()
 {
     //freopen("in.txt","r",stdin) ;
     int T ;
     scanf("%d" , &T) ;
     while(T--)
     {
         int n , i ;
         scanf("%d" , &n) ;
         getchar() ;
         for (i =  ; i < n ; i++)
         {
             gets(a[i].name) ;
             int len = strlen(a[i].name) ;
             sscanf(&a[i].name[len-] , "%d" , &a[i].age);
             a[i].name[len-] = '\0' ;
         }

         sort(a , a+n , cmp) ;
         for (i =  ; i < n ; i++)
             printf("%s\n" , a[i].name) ;

     }

     return  ;
 }