UVA 10905- Children's Game(sort处理string字符串)

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个数，求它们连接以后的最大数。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <queue>

using namespace std;
string str[110];
string s;

char cmp(string a,string b)//返回字符串相连以后较大的那个
{
    return a+b>b+a;
}

int main()
{
    int n,i;
    while(~scanf("%d",&n)){
        if(n==0)
            break;
        s="";//对s的初始化
        for(i=0;i<n;i++)
            cin>>str[i];
        sort(str,str+n,cmp);
        for(i=0;i<n;i++)
            s+=str[i];
        cout<<s<<endl;
    }
    return 0;
}