-->
当前位置:首页 > 题库

PROGRAMMING:Keven's string

Luz5年前 (2021-05-10)题库375
Recently, Keven is very fond of numbers, and he is very good at splicing many numbers into one number. Your task is to output the smallest of all the numbers Keven can output.
Suppose Keven has three numbers, [12, 9, 25], then the number Keven can get is [122591292591225925122512925912], so the answer is 12259.
Note that in this question, Keven must use all the numbers.
###Input format:
The first line is an integer $$n $, which means there are $$n $$numbers$$ 1<=n<=100$$)
In the second line, $$n $$numbers, [$$a]_ 1,a_ 2,a_ 3,a_ N $$] represents the number obtained by Keven$$ 1<=a_ i<=100$$)
###Output format:
Output the smallest number Keven can splice in one line.
###Input example:
```in
three
12 9 25
```
###Output example:
The corresponding output is given here. For example:
```out
twelve thousand two hundred and fifty-nine
```







answer:If there is no answer, please comment