The Smallest String Concatenation CodeForces - 632C (string sort)

最新推荐文章于 2019-05-12 13:43:47 发布

Hanylch

最新推荐文章于 2019-05-12 13:43:47 发布

阅读量340

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/zhuanshunzhe/article/details/72667404

思维同时被 2 个专栏收录

11 篇文章

订阅专栏

技巧

11 篇文章

订阅专栏

本文介绍了一种算法，用于将多个字符串按特定顺序拼接，以获得字典序最小的结果。通过自定义字符串比较函数实现排序，最终输出排序后的字符串拼接结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Example
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<stdio.h>
#include<string>
#include<iostream>
#include<algorithm>

using namespace std;

string a[50010];
int n;
int cmp(string a,string b)
{
    return a+b < b+a;  // 想到这样排序就好了。。。
}
int main()
{
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        cin >> a[i];

    sort(a,a+n,cmp);
    for(int i=0;i<n;i++)
        cout << a[i];

    return 0;   
}