The Smallest String Concatenation CodeForces 632C 字符串

You’re given a list of n strings a1, a2, …, an. You’d like to concatenate them together in some order such that the resulting string would be lexicographically smallest.

Given the list of strings, output the lexicographically smallest concatenation.

Input
The first line contains integer n — the number of strings (1 ≤ n ≤ 5·104).

Each of the next n lines contains one string ai (1 ≤ |ai| ≤ 50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104.

Output
Print the only string a — the lexicographically smallest string concatenation.

Example
Input
4
abba
abacaba
bcd
er
Output
abacabaabbabcder
Input
5
x
xx
xxa
xxaa
xxaaa
Output
xxaaaxxaaxxaxxx
Input
3
c
cb
cba
Output
cbacbc

将所有字符串拼接起来使得总字符串的字典序最小，对字符串进行排序，比较两个字符串是通过比较他们拼接后的字典序。自己想半天也没有思路，看了别人的代码才懂，但要是让我自己考场上想也许想破脑袋也想不出来……
从正面证明，要使总字符串字典序最小，其中任意两个字符串肯定要保证他们拼接起来的字典序最小，例如a…ax，xb…x，这样才能使中间插入其他字符串的时候保证总体的字典序还是最小的
从反面证明，通过这样拼接起来的总字符串，如果将其中一个字符串改变顺序，肯定会使字典序变大。例如s1,s2,s3 < s1,s3,s2 < s3,s1,s2

#include <iostream>
#include <stdio.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
#include <iterator>
#include <string.h>
using namespace std;
typedef long long ll;
int mo[4][2]={0,1,1,0,0,-1,-1,0};
const int MAXN=0x3f3f3f3f;
const int sz=50005;
int n,m;
string s[sz];
bool cmp(string a,string b){
    return a+b<b+a;
}
int main()
{
    //freopen("r.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            cin>>s[i];
        }
        sort(s,s+n,cmp);
        string a=s[0];
        for(int i=1;i<n;i++){
            a+=s[i];
        }
        cout<<a<<endl;
    }
    return 0;
}