uva10905
来源:互联网 发布:电脑怎么清理软件 编辑:程序博客网 时间:2024/06/10 19:49
题意,给n个数字,将它们重新排序得到一个最大的数字,如123 456 789 拼为 789456123 最大
代碼:
#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<iostream>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];printf("\n");}return 0;}
0 0
- uva10905
- UVA10905
- uva10905
- uva10905
- Uva10905
- UVA10905
- uva10905
- uva10905
- uva10905
- uva10905
- uva10905
- UVa10905
- uva10905 - Children's Game
- Uva10905 Children's Game
- uva10905-Children's Game
- UVA10905- Children's Game
- UVA10905 - Children's Game
- UVA10905孩子们的游戏
- 【C++学习笔记】for循环
- XML和相关技术总结
- 原码、反码、补码
- 2017.4.4第四次測試總結
- LeetCode
- uva10905
- [LibreOffice]Calc文档开发_004:Calc文档_文本内容的插入
- C语言函数sscanf()的用法
- spring cloud配置管理器的思考
- linear regression(3)-Gradient Descent in Practice I/II(Feature Scalling/Learning Rate)
- 1015. 德才论 (25)-PAT乙级
- uva10763
- PHP与MySQL第一天笔记
- 那些好玩的gradle