C - The Smallest String Concatenation
Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Description
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.
Sample Input
Input
4
abba
abacaba
bcd
er
Output
abacabaabbabcder
Input
5
x
xx
xxa
xxaa
xxaaa
Output
xxaaaxxaaxxaxxx
Input
3
c
cb
cba
Output
cbacbc
题源http://acm.hust.edu.cn/vjudge/contest/view.action?cid=109071#problem/C
C - The Smallest String Concatenation
Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescription
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.
Sample Input
4 abba abacaba bcd er
abacabaabbabcder
5 x xx xxa xxaa xxaaa
xxaaaxxaaxxaxxx
3 c cb cba
cbacbc
int a[1100000];
int b[11000];
int main()
{
int t,n,m,i,j,k,flag,flag1,du;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
for(i=1; i<=m; i++)
scanf("%d",&b[i]);
k=1;
flag1=0;
flag=1;
for(i=1; i<=n; i++)
{
if(a[k]==b[1])
{
flag=0;
du=k;
for(j=1; j<=m; j++)
{
// printf("%d %d\n",k+j-1,j);
if(a[k+j-1]!=b[j])
{
flag=1;
k++;
break;
}
if(k+j-1==n&&j<m)
{
flag=1;
break;
}
}
//printf("%d %d\n",flag,k);
if(flag==0)
{
flag1=0;
break;
}
if(flag==1)
{
k++;
if(k>n+1-m)
{
//printf("%d %d",k,n+2-m);
flag1=1;
break;
}
}
}
else
{
k++;
}
}
if(flag1==0)
printf("%d\n",du);
else
printf("-1\n");#include<stdio.h>
}
}
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
const int n=51000;
string s[n];//c++中一种新的字符串
int cmp(string a,string b)
{
return a+b<b+a;//a+b是把a与b连接成一个新的字符串,与b+a是不一样的·
}
int main()
{
int i,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>s[i];
}
sort(s,s+n,cmp);
for(i=0;i<n;i++)
cout<<s[i];
cout<<endl;
}