#P470H. Array Sorting
-
ID: 7699
Type: RemoteJudge
2000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: 8
Uploaded By:
Hydro
Tags> Array Sorting
Description
Sorting arrays is traditionally associated with high-level languages. How hard can it be in FALSE? Sort the given array in non-descending order.
The input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ ai ≤ 100).
Output space-separated elements of the sorted array.
Input
The input consists of a single line of space-separated integers. The first number is n (1 ≤ n ≤ 10) — the size of the array. The following n numbers are the elements of the array (1 ≤ ai ≤ 100).
Output
Output space-separated elements of the sorted array.
3 3 1 2
7 12 2 3 44 5 60 2
1 2 3
2 2 3 5 12 44 60