PAT A1038：Recover the Smallest Number之sort排序

题目描述

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

求解思路

按照拼接后的字符串从小到大排序。
注意特殊情况：如果字符串头一直为’0’那么则一直清除它，如果处理后的字符串为空那么输出"0"

代码实现(AC)

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