南阳理工学院个人积分赛第三场——C - The Smallest String Concatenation【string】

终于知道多刷题的重要性了，自己以前总觉得一样的题刷多了没用，要精练

C - The Smallest String Concatenation

Time Limit:3000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 632C

Description

You're given a list of n strings a₁, a₂, ..., a_n. 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·10⁴).

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

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

---

FAQ | About Virtual Judge |  Forum |  Discuss |  Open Source Project
All Copyright Reserved ©2010-2014  HUST ACM/ICPC TEAM 

这道题如果会用C++里的string就可以做了，谁让我平时不打cf，他们打过的都好屌(⊙ ︿ ⊙)

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
using namespace std;
string a[50010];
char cmp(string x,string y)
{
    return x+y<y+x;//注意这里不能加=
}
int main()
{
    int n,i;
    while(~scanf("%d",&n))
    {
        for(i=0;i<n;i++)
        cin>>a[i];
        sort(a,a+n,cmp);
        for(i=0;i<n;i++)
        cout<<a[i];
        cout<<endl;

    }
    return 0;
}