b051: 2. 排列最大值 FYI: https://yunlinsong.blogspot.com/2015/07/blog-post.html

b051.cpp

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

using namespace std;

bool cmp(const string& s1, const string& s2)
{
    return (s1 + s2).compare(s2 + s1) > 0;
}

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