UVa 10905 Children's Game / 贪心
2013-12-06 20:05
417 查看
给你n个数字 求一个组合 使n个数字按顺序组成的数最大 贪心 排序输出即可
#include <stdio.h> #include <string> #include <iostream> #include <algorithm> using namespace std; string a[100]; bool cmp(string a,string b) { string s1,s2; s1 = a+b; s2 = b+a; return s1 > s2; } int main() { int i,n; while(scanf("%d",&n),n) { for(i = 0; i < n; i++) { cin >> a[i]; } sort(a,a+n,cmp); string s; for(i = 0;i < n; i++) { s += a[i]; //cout << a[i] << endl; } cout << s << endl; } return 0; }
相关文章推荐
- UVa 10905 Children's Game ( 贪心 )
- UVA 10905 Children's Game 孩子的游戏 贪心
- UVA - 10905 Children's Game(贪心)
- uva - 10905 - Children's Game(贪心,qsort排序)
- UVa 10905 Children's Game 贪心
- uva 10905 Children's Game 儿童游戏
- UVa 10905 Children's Game 解法
- UVA 10905- Children's Game(sort处理string字符串)
- UVA 10905 Children's Game
- UVA 10905 Children's Game 孩子们的游戏 【贪心】
- UVa 10905 - Children's Game
- UVa 10905 - Children's Game
- UVA - 10905 Children's Game(字典序)
- uva 10905 - Children's Game
- UVa 10905 - Children's Game(求多个正整数排列后,所得的新的数字的极值)
- Uva 10905 — Children's Game
- UVA 10905 Children's Game(数字组合求最大)
- 4th IIUC Inter-University Programming Contest, 2005 / UVa 10905 Children's Game (等长转化技巧)
- UVA - 10905 Children's Game
- UVA 10905(Children's Game-C的qsort函数和sprintf)