sortare

Time limit: 0.5s
Memory limit: 64MB
Input: sortare.in
Output: sortare.out

Task

Given an array of nn natural numbers, sort it in non-decreasing order.

Input data

The file sortare.in contains on the first line a natural number nn. The next line contains nn numbers which form the array.

Output data

The file sortare.out contains on the first line nn numbers, the sorted array.

Constraints and clarifications

  • 1n1 000 0001 \leq n \leq 1\ 000\ 000
  • 1vi1 000 000 0001 \leq v_i \leq 1\ 000\ 000\ 000, 1in1 \leq i \leq n

Example

sortare.in

6
11 8 15 20 5 2

sortare.out

2 5 8 11 15 20

Problem info

ID: 9

Editor: AlexVasiluta

Tags:

Log in or sign up to be able to send submissions!