PAT 甲级 1038 Recover the Smallest Number

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 (≤104) 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

题目分析

我想吃巧克力！

奇怪的cmp函数14/15AC代码

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std; 
bool comp(string lhs,string rhs){
	if(lhs[0] == rhs[0]){
		if(lhs.size() == rhs.size()){
			return lhs < rhs;
		}
		else{
			while(lhs.size()<rhs.size()){
				lhs += lhs[0];
			}
			while(lhs.size()>rhs.size()){
				rhs += rhs[0];
			}
			return lhs < rhs;
		}
	}
	else{
		return lhs[0] < rhs[0];
	}

}
vector<string> nums;
int main(){
	int N;
	string temp;
	cin >> N;
	for (int i = 0; i < N; i++){
		cin >> temp;
		nums.push_back(temp);
	}
	sort(nums.begin(), nums.end(), comp);
	string ret ="";
	for (int i = 0; i < N;i++){
		ret += nums[i];
	}
	while(ret.size()!=0&&ret[0] == '0'){
		ret.erase(ret.begin());
	}
	if(ret.size()==0)
		cout << 0;
	cout << ret;
	return 0;
}

正常cmp函数AC代码

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std; 
bool comp(string lhs,string rhs){
    return lhs+rhs<rhs+lhs;
}
vector<string> nums;
int main(){
	int N;
	string temp;
	cin >> N;
	for (int i = 0; i < N; i++){
		cin >> temp;
		nums.push_back(temp);
	}
	sort(nums.begin(), nums.end(), comp);
	string ret ="";
	for (int i = 0; i < N;i++){
		ret += nums[i];
	}
	while(ret.size()!=0&&ret[0] == '0'){
		ret.erase(ret.begin());
	}
	if(ret.size()==0)
		cout << 0;
	cout << ret;
	return 0;
}