Preparando MOJI

Array Sorting

2000ms 262144K

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.

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.

Sample Input:

3 3 1 2

Sample Output:

1 2 3 

Sample Input:

7 12 2 3 44 5 60 2

Sample Output:

2 2 3 5 12 44 60 

Informação

Codeforces

Provedor Codeforces

Código CF470H

Tags

*special

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:53:44

Relacionados

Nada ainda