Educational Codeforces Round 9 C. The Smallest String Concatenation 排序
2016-03-02 22:33
323 查看
C. The Smallest String Concatenation
题目连接:
http://www.codeforces.com/contest/632/problem/CDescription
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.Sample Input
4abba
abacaba
bcd
er
Sample Output
abacabaabbabcderHint
题意
给你n个串,然后你要组合这n个串,使得n个串的字典序最小题解:
写个CMP就好了~代码
#include<bits/stdc++.h> using namespace std; const int maxn = 5e4+5; string s[maxn]; bool cmp(string a,string b) { string ab = a+b; string ba = b+a; return ab<ba; } 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; }
相关文章推荐
- 《C#高级编程》读书笔记
- 关键字模糊匹配
- ASP.NET MVC中viewData、viewBag和templateData的使用与区别
- bzoj 1085: [SCOI2005]骑士精神
- 从C/C++到Objective-C(三)--- 内存管理
- 【算法】错排——错误引发的讨论
- 51Nod 1278 相离的圆(好题)
- 面向对象的三个基本元素,五大基本原则
- 从堆栈快速定位出错的代码行
- 常见验证码的弱点与验证码识别
- bzoj 1084: [SCOI2005]最大子矩阵
- ui-router(三)controller与template
- js 判断两个变量是否相等
- Android主线程、子线程通信(Thread+handler)
- 导学目录-学如逆水行舟
- 【JAVA知识】集合框架
- NAT工作原理
- http://lib.csdn.net
- TextView实现跑马灯效果
- C++程序员快过来围观:非常实用全面的 C++资源