Preparando MOJI

Array sorting

2000ms 65536K

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.

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.

Sample Input:

5
7
1
9
7
3

Sample Output:

1 3 7 7 9 

Sample Input:

10
60
1
60
1
60
1
60
1
60
1

Sample Output:

1 1 1 1 1 60 60 60 60 60 

Informação

Codeforces

Provedor Codeforces

Código CF130I

Tags

*specialsortings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:33:42

Relacionados

Nada ainda