跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1341. The Smallest String Concatenation

  • ID: 1347
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 排序
  • 字符串
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

The Smallest String Concatenation

题目描述

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 840 题。保留原作者与原赛事署名。