题目

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 (≤10⁴ ) 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. Notice that the first digit must not be zero.

Sample Input:

5 32 321 3214 0229 87

Sample Output:

22932132143287

AC代码

#include<bits/stdc++.h>
using namespace std;bool cmp(string x,string y){string xy=x+y,yx=y+x;return xy<yx;
}int main()
{int n,len;cin>>n;string s[n];for(int i=0;i<n;i++){cin>>s[i];len+=s[i].length();}sort(s,s+n,cmp);string ans="";for(int i=0;i<n;i++)ans+=s[i];stringstream ss;int t;ss<<s[n-1];ss>>t;if(t==0){cout<<0;return 0;} int flag=1;for(int i=0;i<ans.length();i++){if(flag&&ans[i]=='0') continue;else flag=0;cout<<ans[i];}
}

参考

Recover the Smallest Number (30) - 字符串排序

知识点总结

stringstream的相关用法
字符串排序

PAT——Recover the Smallest Number相关推荐

PAT甲级1038 Recover the Smallest Number (30 分)：[C++题解]贪心、排列成最小的数、字符串
文章目录题目分析题目来源题目分析来源:acwing 分析: 贪心: 对于字符串a和b,如果 a+b < b+a (这里+代表字符串中的连接)代表字典序更小.举例 a = 321 , b ...
PAT甲级：1038 Recover the Smallest Number
题目描述: Given a collection of number segments, you are supposed to recover the smallest number from th ...
pat1038. Recover the Smallest Number (30)
1038. Recover the Smallest Number (30) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHE ...
1038. Recover the Smallest Number (30)
1038. Recover the Smallest Number (30) 进行排序,注意comp的写法: #include <iostream> #include <vector ...
1038 Recover the Smallest Number (30分)
题目 Given a collection of number segments, you are supposed to recover the smallest number from them. ...
PAT-A-1038 Recover the Smallest Number 【贪心】【二刷】
贪心算法,最核心的在于贪心策略上 Given a collection of number segments, you are supposed to recover the smallest num ...
A1038 Recover the Smallest Number (30)
Powered by:NEFU AB-IN Link 文章目录 A1038 Recover the Smallest Number (30) 题意思路代码 A1038 Recover the Sm ...
PAT (Advanced Level) 1038. Recover the Smallest Number (30)
注意前导零的消去. #include <iostream> #include <string> #include <sstream> #include <al ...
1038 Recover the Smallest Number (30 分)【难度: 中 / 知识点: 贪心思维】
https://pintia.cn/problem-sets/994805342720868352/problems/994805449625288704 PAT上的这道题的数据有点弱,其它网站上的数 ...

PAT——Recover the Smallest Number

Recover the Smallest Number

题目

AC代码

参考

知识点总结

PAT——Recover the Smallest Number相关推荐

最新文章

热门文章