UVA - 10905 Children's Game（贪心）

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#Uva #10905 #Childrens Game

贪心专栏收录该内容

36 篇文章

订阅专栏

本文介绍了一个简单的儿童数字游戏，玩家需要通过重新排列一系列正整数来形成可能的最大整数。文章提供了一段C++代码实现，该算法首先比较每两个数字的所有可能组合，然后根据能形成较大数字的方式进行排序。

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

题目大意：给n个数字，将它们重新排序得到一个最大的数字

解析：每两个数字间有两种拼法, 按拼出数字大的排序, 接着输出即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
string num[1000];

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