4th IIUC Inter-University Programming Contest, 2005 | |
A | Children’s Game |
Input: standard input | |
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 | 9056124123 |
题意: 要求给出n个数字, 将这几个串起来, 求最大能串出的数字~
做法: 好像是做的第一次贪心~ 就是每两个数字间有两种拼法, 按拼出数字大的排序, 接着输出即可
AC代码:
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(string a, string b) {
return a+b > b+a;
}
int main() {
int n;
string num[100];
while(cin >> n && n!= 0) {
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;
}