#P130I. Array sorting
-
ID: 2239
Type: RemoteJudge
2000ms
64MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
Hydro
Tags> Array sorting
No submission language available for this problem.
Description
Sorting arrays is traditionally associated with high-level languages. How hard can it be in Befunge? Sort the given array in non-descending order.
The first line of input contains an integer n (1 ≤ n ≤ 100) — the size of the array. The following n lines contain the elements of the array, one per line. Each element of the array is an integer between 1 and 60, inclusive. The array might contain duplicate elements.
Output space-separated elements of the sorted array.
Input
The first line of input contains an integer n (1 ≤ n ≤ 100) — the size of the array. The following n lines contain the elements of the array, one per line. Each element of the array is an integer between 1 and 60, inclusive. The array might contain duplicate elements.
Output
Output space-separated elements of the sorted array.
Samples
5
7
1
9
7
3
1 3 7 7 9
10
60
1
60
1
60
1
60
1
60
1
1 1 1 1 1 60 60 60 60 60