本文主要是介绍The Smallest String Concatenation，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
强大的stl，还有这种操作~~
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.
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.
Print the only string a — the lexicographically smallest string concatenation.
4 abba abacaba bcd er
abacabaabbabcder
5 x xx xxa xxaa xxaaa
xxaaaxxaaxxaxxx
3 c cb cba
cbacbc
#include<iostream>
#include<string>
#include<algorithm>
#define maxn 50005
using namespace std;
bool cmp(string a,string b)
{return a+b<b+a;
}
int main()
{int n;string str[maxn];cin >>n;for(int i=0;i<n;i++)cin >>str[i];sort(str,str+n,cmp);for(int i=0;i<n;i++)cout <<str[i];return 0;
} 这篇关于The Smallest String Concatenation的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
