Children's Game
来源:互联网 发布:淘宝手机p图教程视频 编辑:程序博客网 时间:2024/06/14 18:09
题意:
将输入的数串连成最大值。
思路:
直接按照字典集排序是不行的,比如99字典序小于991,但是99991大于99199,所以比较两个串相加后的字典序即可
代码:
#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>#include<string>using namespace std;int cmp(string a, string b) {return a+b > b+a;}string s[55];int main() {int n;while(scanf("%d", &n) && 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;}return 0;}
0 0
- 10905 - Children's Game
- 10905 - Children's Game
- 10905 - Children's Game
- uva10905 - Children's Game
- UVaOJ10905 - Children's Game
- 10905 - Children's Game
- Uva10905 Children's Game
- uva10905-Children's Game
- UVA10905- Children's Game
- uva Children's Game
- Children's Game
- UVA10905 - Children's Game
- 10905 - Children's Game
- uva10905 - Children's Game
- Uva Children's Game
- Children's Game
- uva10905 - Children's Game
- UVA10905 Children's Game
- IOS开发:performSelector: withObject:afterDelay 的Object里传入多个参数
- HDU1301 并查集和最小生成树
- Vmware win虚拟机无法上网
- Hibernate框架由myeclipse自动生成遇到的问题
- Docker常用命令
- Children's Game
- NoClassDefFoundError
- 学生信息管理系统-c语言(文本菜单系统)
- 【BZOJ3152】组合子逻辑,贪心+堆
- All in All
- Spring+Struts2+Hibernate+Apache POI 实现的Excel2007导入导出功能代码分享
- Activity
- 保存会话的两个技术:cookie和seesion
- 最大公约数GCD 1