codeforces 632C. The Smallest String Concatenation 排序

题目链接

给出n个字符串， 将他们连在一起， 求连玩之后字典序最小的那种情况。

按a+b<b+a排序....

#include <iostream>
#include <vector>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define pb(x) push_back(x)
#define ll long long
#define mk(x, y) make_pair(x, y)
#define lson l, m, rt<<1
#define mem(a) memset(a, 0, sizeof(a))
#define rson m+1, r, rt<<1|1
#define mem1(a) memset(a, -1, sizeof(a))
#define mem2(a) memset(a, 0x3f, sizeof(a))
#define rep(i, n, a) for(int i = a; i<n; i++)
#define fi first
#define se second
typedef pair<int, int> pll;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int mod = 1e9+7;
const int inf = 1061109567;
const int dir[][2] = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };
string s[50005];
bool cmp(string a, string b) {
    return a+b<b+a;
}
int main()
{
    int n;
    cin>>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;
}