| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 11307 | EECS Simple 001 |
|
| 12708 | PME-HW3 |
|
| 13168 | PME-110-MID01 |
|
| 13169 | PME-110-MID03 |
|
| 13170 | PME-110-MID05 |
|
Description
Given a list of N digits, re-arrange the digits in non-decreasing order.
For example, if the list is 4 7 4 9 7, the output should be 4 4 7 7 9.
Input
The input has two lines.
The first line is an integer N indicating the number of digits in the list.
The second line contains the N digits, separated by a whitespace.
Output
The output is the re-arranged digits, separated by a whitespace. The is NO newline character at the end of the ouput.