【PAT】A-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 (≤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，如果A+B的字典序比B+A小（这里的“+”指字符换拼接，而不是算术加法），则将A排在前面，反之，将B排在后面。依照以上规则对数组进行排序。
• 然后对数组进行拼接。
• 最后去除前导零。如果去除后字符串为空，则输出0。

代码

#