题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=29622
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
char name[1000];
}q[10005];
int cmp(node a,node b)
{
for(int i=0;i<strlen(a.name);i++)
{
if(a.name[i]==b.name[i])
continue;
else return a.name[i]<b.name[i];
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%s",&q[i].name);
}
sort(q,q+n,cmp);
for(int i=0;i<n;i++)
{
printf("%s",q[i].name);
}
printf("\n");
}
}