UVA 10905 - Children’s Game

儿童数字游戏的贪心策略

最新推荐文章于 2019-08-16 16:41:08 发布

原创最新推荐文章于 2019-08-16 16:41:08 发布 · 491 阅读

0 ·

CC 4.0 BY-SA版权

UVA 同时被 2 个专栏收录

41 篇文章

订阅专栏

贪心

8 篇文章

订阅专栏

本文探讨了一款儿童数字游戏的贪心算法解决方案。玩家将获得多个正整数，通过将这些数字按特定方式拼接，以形成最大的可能整数。文章详细介绍了输入格式、输出要求，并提供了一个高效的贪心算法实现。

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

================================

贪心……吧？

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

using namespace std;

string str[55];

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

int main()
{
    int n;
    while(cin>>n)
    {
        if(n==0) break;
        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;
}