A1038. Recover the Smallest Number (30)
来源:互联网 发布:教粤语的软件 编辑:程序博客网 时间:2024/05/29 23:23
1038. Recover the Smallest Number (30)
Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.
Input Specification:
Each input file contains one test case. Each case gives a positive integer N (<=10000) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the smallest number in one line. Do not output leading zeros.
Sample Input:5 32 321 3214 0229 87Sample Output:
22932132143287
#include<iostream>#include<algorithm>//sort can't be used for char str[],use a struct and put char str[] in itusing namespace std;bool cmp(string a,string b){return a+b < b+a;}int main(){int n;cin >> n;string str[n],sum;for(int i = 0;i < n;i++)cin >> str[i];sort(str,str+n,cmp);for(int i = 0;i < n;i++)sum += str[i];while(sum.size() && sum[0]=='0') sum.erase(sum.begin());if(sum.size())cout << sum << endl;elsecout << 0 << endl;//考虑全为0时return 0;}
- A1038. Recover the Smallest Number (30)
- pat-a1038. Recover the Smallest Number (30)
- A1038. Recover the Smallest Number (30)
- PAT A1038 recover the smallest number (30)
- PAT甲级练习题A1038. Recover the Smallest Number (30)
- 贪心算法--PAT.A1038.Recover the Smallest Number
- Recover the Smallest Number (30)
- Recover the Smallest Number (30)
- PAT A1038 Recover the Smallest Number 算法问题和关于'0'和0的小错误
- 1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)-PAT
- 1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)
- PAT1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)
- 1038. Recover the Smallest Number (30)
- nginx+lua+redis构建高并发应用
- 安装新版本Qt Creator后F1无法显示帮助文档的问题
- codeforces 571 A Lengthening Sticks
- Thinking in java 之:this关键字
- 网页正文、屏幕、滚动条相关
- A1038. Recover the Smallest Number (30)
- 分布式与集群的区别
- HTML-Ajax文件上传
- MFC(ftp)
- 4.3.5、notifications工作原理
- HDU 5417 Victor and Machine(模拟||递推)
- 图片
- C++实现九宫格游戏人机对战
- USACO2013 island travels