TSORT - Turbo Sort

no tags 

Given the list of numbers, you are to sort them in non decreasing order.

Input

t – the number of numbers in list, then t lines follow [t <= 10^6].
Each line contains one integer: N [0 <= N <= 10^6]

Output

Output given numbers in non decreasing order.

Example

Input:

5
5
3
6
7
1

Output:

1
3
5
6
7

hide comments
imkiller: 2018-06-03 09:20:49

Just Write a merge sort!

anh_duc: 2018-04-18 14:27:28

Quick Sort got me AC in one go

code_aim: 2017-07-05 07:08:09

0.15s

Bryan Poulsen: 2017-02-15 19:45:50

I submitted the same solution 2 times with Python 3: first time I got WA, second time I got AC... Kind of random. Same solution works with python2.6 - 3.6 (minus the random single WA)

tungtd95: 2016-11-11 11:24:02

combsort is fine

vigneshkv: 2016-10-12 14:22:25

Counting sort got me AC !! :)

Kaushal Pranav B: 2016-07-21 07:25:23

Quicksort did not get accepted but merge sort did.

square1001: 2016-07-17 05:05:05

I submitted 2 submission (completely same code) and first I got TLE but second I got AC for 2.49 seconds!!!

Christian López: 2016-04-16 01:05:40

Too easy, so don't use cin/cout.

lalit_nit: 2016-01-20 12:48:27

stl sort +cin cout = 2.50
stl sort+ scanf printf = .31


Added by:Roman Sol
Date:2005-03-14
Time limit:2.700s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ZCon