1038 Recover the Smallest Number (30 分)-CSDN博客

本文介绍了一道涉及贪心策略的编程题目，通过字符串链接技巧找到由给定数字段组合成的最小整数。关键在于利用字符链接的传递性来确定最优组合。实例演示了如何使用C++实现并解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

总结：一道贪心的好题，主要用的是字符链接后的传递性。
若字符串A与字符串B满足B+A<A+B则应该交换位置且对后面的具有传递性
以3个串为例
若B+A<A+B 必然加上C后满足
B+A+C<A+B+C

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;  
bool cmp(const string& A, const string& B) { return A + B < B + A; }
vector<string>V;
int N;
string ret; 
int main(){
	scanf("%d", &N);
	V.resize(N);
	for (int i = 0; i < N; i++)
		cin >> V[i];  
	sort(V.begin(), V.end(), cmp);
	for (vector<string>::iterator it = V.begin(); it != V.end(); it++)
		ret += *it;
	while (ret.length() > 1 && ret[0] == '0')
		ret.erase(ret.begin());
	cout << ret;
	return 0;
}