CodeForces 632C The Smallest String Concatenation

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

围巾的ACM

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

阅读量435

点赞数

CC 4.0 BY-SA版权

分类专栏：水题

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51023043

水题专栏收录该内容

159 篇文章

订阅专栏

本文介绍了一种算法，用于将多个字符串以特定顺序连接，使最终字符串在字典序中最小。通过自定义比较函数并使用标准排序方法实现。

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

题意：给定几个串，问如何组合起来使得字典序最小

思路：直接排个序就搞定了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
const int maxn = 50000+1000;
#define LL long long
int cas=1,T;
string s[maxn];
bool cmp(string a,string b)
{
	string aa = a+b;
	string bb = b+a;
	return aa<bb;
}
int main()
{
	int n;
	scanf("%d",&n);
	for (int i = 0;i<n;i++)
		cin >> s[i];
	sort(s,s+n,cmp);
	for (int i = 0;i<n;i++)
		cout << s[i];
	cout << endl;
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

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