[排序]Children's Game uva10905

4th IIUC Inter-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 Nintegers.

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个正整数，你可以将一个整数接在另一个整数之后以制造一个更大的整数。例如，这有4个数字123, 124, 56, 90，他们可以制造下列整数─ 1231245690, 1241235690, 5612312490, 9012312456, 9056124123....等，总共可以组合出24(4!)种数字。但是，9056124123是最大的那一个。你可能会想这是个简单的事情，但对刚有数字概念小孩来说，这会是个简单的任务吗?

解法：这就是一个简单字符串排序问题了，找到两个字符串如何组合才能使得字符串最大的规则就简单多了。

#include<iostream>
#include<algorithm>
#include<string>

using namespace std;

string str[100];

bool cmp(string str1,string str2)
{
    return str1+str2>str2+str1;
}

int main()
{
    int n;
    while(cin>>n&&n)
    {
        for(int i=0;i<n;i++)
            cin>>str[i];
        sort(str,str+n,cmp);
        for(int i=0;i<n;i++)
            cout<<str[i];
        cout<<endl;
    }
    return 0;
}