1038 Recover the Smallest Number (30分)cmp函数

Jcldcdmf

于 2020-04-16 12:17:15 发布

阅读量126

点赞数

CC 4.0 BY-SA版权

分类专栏： PTA

本文链接：https://blog.youkuaiyun.com/qq_37613112/article/details/105555075

PTA 专栏收录该内容

54 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的数字段集合中恢复出可能的最小数字。通过使用自定义的比较函数，该算法能够正确处理数字段的顺序，确保组合成的数字最小，同时避免首位为零的情况。

摘要生成于 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.

关键是cmp函数：

bool cmp(string s1, string s2) {
	return s1 + s2 < s2 + s1;
}

1038 Recover the Smallest Number (30分)cmp函数

Input Specification:

Output Specification:

关键是cmp函数：

一开始咋就没想到呢？