Description
给你一串数,重新排列,输出最大的
Algorithm
贪心,排序,详见代码
Code
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int n;
const int MAXN = 50 +9;
string a[MAXN];
bool comp(string x, string y)
{
return x + y > y + x;
}
void solve()
{
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, comp);
for (int i = 0; i < n; i++) {
cout << a[i];
}
cout << endl;
}
int main()
{
// freopen("in.txt", "r", stdin);
for (;;) {
scanf("%d", &n);
if (n == 0) break;
solve();
}
}