UVA Children’s Game(贪心)

Description

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.

    题意：输入一个n，然后接着输入n个数，输出这n个数组合的最大数。

代码：

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

using namespace std;

int cmp(string a,string b)
{
    return b+a > a+b;
}

int main()
{
    int n;
    string str[55];
    string maxx;
    while(scanf("%d",&n)!=EOF)
    {
        if(n == 0)
        {
            break;
        }
        maxx = "";
        for(int i=0;i<n;i++)
        {
            cin >> str[i];
        }
        sort(str,str+n,cmp);
        for(int i=n-1;i>=0;i--)
        {
            maxx = maxx + str[i];
        }
        cout << maxx << endl;
    }
    return 0;
}