Largest Concatenation

Difficulty: 1600 3000 ms 128 MB

greedy sorting

Arrange the numbers in some order and concatenate their decimal representations. Print the largest number you can form (as a string, no leading zeros unless the value is 0).

Input: the first line has N; the second line has N non-negative integers.

Output: the largest concatenation.

Constraints:

• 1 ≤ N ≤ 10⁴
• 0 ≤ a_i ≤ 1000

Sample Tests

3
10 2 9

9210

2
0 0

0

Read the Editorial