188G.md (870B)
1 Source: https://codeforces.com/problemset/problem/188/G 2 3 G. Array Sorting 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Sorting arrays is traditionally associated with high-level languages. How hard can it be in Roco? Sort the given array in non-descending order. 22 23 Input 24 25 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 100, inclusive. The array might contain duplicate elements. 26 27 Output 28 29 Output space-separated elements of the sorted array. 30 31 Examples 32 33 Input 34 35 ``` 36 5 37 7 38 1 39 9 40 7 41 3 42 ``` 43 44 Output 45 46 ``` 47 1 3 7 7 9 48 ``` 49 50 Input 51 52 ``` 53 10 54 100 55 1 56 100 57 1 58 100 59 1 60 100 61 1 62 100 63 1 64 ``` 65 66 Output 67 68 ``` 69 1 1 1 1 1 100 100 100 100 100 70 ```