UVA 10905 Children's Game（数字组合求最大）

Children's Game

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit  Status

Description

4thIIUCInter-University Programming Contest, 2005
A	Children’s Game
	Input: standard input Output: standard output
	Problemsetter: Md. Kamruzzaman

There are lots of number games for children. These games are pretty easy to play but not so easy to make. We will discuss about an interesting game here. Each player will be given N positive integer. (S)He can make a big integer by appending those integers after one another. Such as if there are 4 integers as 123, 124, 56, 90 then the following integers can be made – 1231245690, 1241235690, 5612312490, 9012312456, 9056124123 etc. In fact 24 such integers can be made. But one thing is sure that 9056124123 is the largest possible integer which can be made.

You may think that it’s very easy to find out the answer but will it be easy for a child who has just got the idea of number?

Input

Each input starts with a positive integer N (≤ 50). In next lines there are N positive integers. Input is terminated by N = 0, which should not be processed.

Output

For each input set, you have to print the largest possible integer which can be made by appending all the N integers.

Sample Input	Output for Sample Input
4 123 124 56 90 5 123 124 56 90 9 5 9 9 9 9 9 0	9056124123 99056124123 99999

题意较简单，给你n个数字，问怎样组合成一个最大的整数

好吧，我承认我上来就打算暴过去，写了那么多结果还WA了，改了两遍才突然发现，我特么写那么多不就是比较的字典序，最后数组开小了又送了两遍RE,sad~~

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#define N 1000
using namespace std;
char s[60][N];
int cmp(const void *a,const void *b)
{
    char xx[N*2];
    strcpy(xx,(char *)a);
    strcat(xx,(char *)b);
    char yy[N*2];
    strcpy(yy,(char *)b);
    strcat(yy,(char *)a);
    return strcmp(yy,xx);
}
int main()
{
    int n;
    while(scanf("%d",&n),n)
    {
        for(int i=0; i<n; i++)
            scanf("%s",s[i]);
        qsort(s,n,sizeof(s[0]),cmp);
        for(int i=0; i<n; i++)
            printf("%s",s[i]);
        printf("\n");
    }
    return 0;
}