首页 > 试题广场 >

Recover the Smallest Number (3

[编程题]Recover the Smallest Number (3
  • 热度指数：2870 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
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.

输入描述:
Each input file contains one test case.  Each case gives a positive integer N (<=10000) 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.


输出描述:
For each test case, print the smallest number in one line.  Do not output leading zeros.
示例1

输入

5 32 321 3214 0229 87

输出

22932132143287
算法知识视频讲解
开通博客

暂无题解

问题信息

贪心 排序
难度：
20条回答 9563浏览

热门推荐

通过挑战的用户

相关试题

Recover the Smallest Number (30)

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号