C :

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
void jsVal(int a[5],int b[10])
{
	int qw, bw, sw, gw, i, newV1, newV2, j,cnt=0 ;
	for(i = 0 ; i < 5; i++) {
		qw = a[i] / 1000 ;
		gw = a[i] % 10 ;
		bw = a[i]/100%10 ;
		sw = a[i]/10%10;
		newV1 = gw * 10 + qw ;
		newV2 = bw * 10 + sw ;
		b[cnt++] = newV1 ;
		b[cnt++]=newV2;

	}

	for(i = 0 ; i < 4 ; i++)
		for(j = 5 ; j < cnt-1-i ; j++)
			if(b[j] < b[j+1]) {
				newV1 = b[j] ;
				b[j] = b[j+1] ;
				b[j+1] = newV1 ;
			}

}


int main()
{
  // freopen("in","r",stdin);
  //  freopen("out","w",stdout);
   int  i,j,n;
   int a[5],b[10];
  while( scanf("%d",&n)!=EOF){
   for(j=0;j<n;j++)
   {
	   for(i=0;i<5;i++)
		   scanf("%d",&a[i]);
	   jsVal(a,b);
	   for(i=0;i<9;i++)
		   printf("%d ",b[i]);
	   printf("%d\n",b[i]);
   }
  }

  return 0;
}

C++ :

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int cmp(int a,int b)
{
	return a>b;
}
int main()
{
	int a[5],k[10],i,j,n,b,c,d,e;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<5;i++)
			scanf("%d",&a[i]);
		for(i=0,j=0;i<10,j<5;j++,i+=2)
		{
            b=a[j]/1000;
			c=(a[j]-b*1000)/100;
			d=(a[j]-b*1000-c*100)/10;
			e=a[j]%10;
			k[i]=e*10+b;
			k[i+1]=c*10+d;
		}
		sort(k,k+n,cmp);
		for(i=0;i<10;i++)
		{
			printf("%d",k[i]);
			if(i!=9)
                 printf(" ");
		}
		printf("\n");
	}	
	return 0;
}