关闭

Educational Codeforces Round 9-C. The Smallest String Concatenation(字符串排序)

96人阅读 评论(0) 收藏 举报
分类:

原题链接

C. The Smallest String Concatenation
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
input
4
abba
abacaba
bcd
er
output
abacabaabbabcder
input
5
x
xx
xxa
xxaa
xxaaa
output
xxaaaxxaaxxaxxx
input
3
c
cb
cba
output
cbacbc
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <iostream>
#include <vector>
#include <queue>
#include<cmath>
#define maxn 50005
#define INF 1e9 + 5
typedef long long ll;
using namespace std;

char p1[120], p2[120];
struct Node{
	char s[55];
	friend bool operator < (const Node&a, const Node&b){
		strcpy(p1, a.s);
		strcpy(p2, b.s);
		strcat(p1, b.s);
		strcat(p2, a.s);
		return strcmp(p1, p2) < 0;
	} 
}node[maxn];
int main(){
	
//	freopen("in.txt", "r", stdin);
	int n;
	
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
	  scanf("%s", node[i].s);
	sort(node, node+n);
	for(int i = 0; i < n; i++)
	 printf("%s", node[i].s);
	puts("");
	
	return 0;
}



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:57585次
    • 积分:4833
    • 等级:
    • 排名:第6145名
    • 原创:442篇
    • 转载:36篇
    • 译文:0篇
    • 评论:9条
    最新评论