A1038 Recover the Smallest Number

最新推荐文章于 2021-02-21 19:59:06 发布

Highlight_Jin

最新推荐文章于 2021-02-21 19:59:06 发布

阅读量237

点赞数

分类专栏： # PAT 文章标签：贪心

本文链接：https://blog.csdn.net/Highlight_Jin/article/details/88926507

版权

PAT 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

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 (≤ $10^{4}$ ) 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

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool cmp(string a, string b){
	return a + b < b + a;
}
int main()
{
	int n;
	cin>>n;
	string str[n];
	for(int i=0; i<n; i++){
		cin >> str[i];
	}
	sort(str, str + n, cmp);
	string ans;
	for(int i = 0; i < n; i++){
		ans += str[i];
	}
	while(ans.size() != 0 && ans[0] == '0'){
		ans.erase(ans.begin());
	}
	if(ans.size() == 0)
		cout << 0;
	else 
		cout << ans;
	return 0;
}