List Minimum (Easy)

View as PDF

Submit solution

Points: 3
Time limit: 0.75s
Java 1.0s
Processing 1.0s
Python 2.5s
Memory limit: 3M
Python 12M

Authors:
Problem type
Brute Force Practice 1 — Easy Version

Given a permutation of the integers 1, 2, \ldots, N, output the permutation after it has been sorted.

Input Specification

The first line will contain the integer N (1 \le N \le 10^6).

The next line will contain N integers, a permutation of the integers 1, 2, \ldots, N.

Output Specification

The sorted permutation on a single line.

Sample Input

3
2 1 3

Sample Output

1 2 3

Comments

There are no comments at the moment.