PAT——Recover the Smallest Number

最新推荐文章于 2022-08-19 05:48:02 发布

此杭非彼航

最新推荐文章于 2022-08-19 05:48:02 发布

阅读量109

点赞数 2

分类专栏： PAT题目练习文章标签： PAT

本文链接：https://blog.csdn.net/ljhsq/article/details/118877664

版权

PAT题目练习专栏收录该内容

154 篇文章 5 订阅

订阅专栏

Recover the Smallest Number

题目
AC代码
参考
知识点总结

题目

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];
	}
}