程序代码：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int comp(const void *p, const void *q)
{
    return strcmp((char *)q, (char *)p);
}

int main()
{  
    int n, i;
    char s[1000][11];
    while (scanf("%d", &n) != EOF)
    {
        for (i = 0; i < n; ++i) scanf("%s", s[i]);
        qsort(s, n, sizeof(s[0]), comp);
        for (i = 0; i < n; ++i) printf("%s", s[i]);
    }
    return 0;
}

程序代码：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int comp(const void *p, const void *q)
{
    char *a = (char *)p;
    char *b = (char *)q;
    int len1 = strlen(a);
    int len2 = strlen(b);
    int i;
    if (len1 == len2) return strcmp(b, a);
    else if (len1 > len2)
    {
        for (i = 0; i < len2; ++i) if (a[i] != b[i]) return b[i] - a[i];
        if (a[len2] < b[0]) return 1;
        else return -1;
    }
    else
    {
        for (i = 0; i < len1; ++i) if (a[i] != b[i]) return b[i] - a[i];
        if (b[len1] < a[0]) return -1;
        else return 1;
    }
}

int main()
{  
    int n, i;
    char s[1000][11];
    while (scanf("%d", &n) != EOF)
    {
        for (i = 0; i < n; ++i) scanf("%s", s[i]);
        qsort(s, n, sizeof(s[0]), comp);
        for (i = 0; i < n; ++i) printf("%s", s[i]);
        printf("\n");
    }
    return 0;
}