Problem

3 /8


Merge sort

Theory Click to read/hide

Error

Problem

Sort this array using merge sort.


Input
The first line of the input contains the number of elements in the array N, N <= 105. Next comes N integers not exceeding 109 in absolute value.


Imprint
Print these numbers in non-decreasing order.
 
Examples
# Input Output
1 2
3 1 		1 3

time 1200 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!