yes

67. Sort

Time Limit: 1 seconds

Memory Limit: 1024 MB

Rating: 800

Sort an array $A$ consisting of $N$ integers $(1\le N\le {10}^5,-{10}^9\le A_i\le {10}^9)$ in ascending order.

Subtasks:
Task 1 (10 points): $N\le \mathrm{1,000}$
Task 2 (90 points): No additional constraints.

The first line has integer $N$.
The second line has $N$ space-separated integers, forming an array $A$.

Output the sorted array as shown in the sample cases.

Sample Input 1:
4
2 3 4 1

Sample Output 1:
1 2 3 4


Sample Input 2:
3
-1000 40 -400

Sample Output 2:
-1000 -400 40

Not available for this problem.

ian