------------------------------------------------------------------------
4thIIUCInter-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 givenN 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 areN positive integers. Input is terminated byN = 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 theN integers.
Sample Input | Output for Sample Input |
4 | 9056124123 |
-------------------------------------------------------------------------
很有意思,很巧妙,排序
//uva 10905 Children's Game
#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <cmath>
#include <string>
#include <queue>
#include <set>
using namespace std;
#ifdef WIN
typedef __int64 LL;
#define iform "%I64d"
#define oform "%I64d\n"
#else
typedef long long LL;
#define iform "%lld"
#define oform "%lld\n"
#endif
#define S64I(a) scanf(iform, &a)
#define P64I(a) printf(oform, a)
const int INF = 0x3f3f3f3f;
const double eps = 10e-9;
const int maxn = 50 + 10;
string ss[maxn];
bool cmp(string a, string b) {
return a+b > b+a;
}
int main() {
int n;
while(scanf("%d", &n) != EOF && n) {
for(int i=0; i<n; i++) cin>>ss[i];
sort(ss, ss+n, cmp);
for(int i=0; i<n; i++) cout<<ss[i];
cout<<endl;
}
return 0;
}