Children's Game

最新推荐文章于 2018-05-08 15:44:39 发布

原创最新推荐文章于 2018-05-08 15:44:39 发布 · 412 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#高效算法设计

高效算法设计专栏收录该内容

4 篇文章

订阅专栏

本文探讨了一款儿童数字游戏的玩法与实现策略，包括如何通过组合不同数字创造最大整数，涉及输入处理、排序算法及输出结果的实现过程。

Children's Game

Description

4^thIIUCInter-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

注意:89 899 897

不能只比较单个字符串,而要将两个字符串连接后进行比较

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
    string s;
}ss[1000];
int cmp(node a,node b)
{
    return a.s+b.s>b.s+a.s;
}
int main()
{
    int n,i;
    while(scanf("%d",&n)!=EOF&&n!=0)
    {
        for(i=0;i<n;i++)
        {
            cin>>ss[i].s;

        }
        sort(ss,ss+n,cmp);
        for(i=0;i<n;i++)
        {
            cout<<ss[i].s;
        }
        cout<<endl;
    }
}