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
(Tjandra Satria Gunawan)(曾毅昆): 2012-12-20 12:08:57

found an algorithm that faster than merge sort ;-)

Deepan: 2012-09-13 04:26:44

got AC using STL :) but merge sort , heap sort failed

anuj kumar: 2012-08-26 05:39:43

Got AC with merge sort... :) :)

radical: 2012-07-28 04:43:37

any solve with python? i try with quick sort and list.sort and the result is Time limit :(

Out0fbounds: 2012-05-14 03:36:52

used stl and got ac

Julian Leyh: 2012-02-09 13:57:38

Time limit very strict for Ada, too. Need about 5s to input, sort, and output 10^6 random integers with N*log(N) algorithm.

IO is very bad in Ada...

Eric Marthinsen: 2011-11-15 18:14:29

The time limit on this problem is too low. No one using an interpreted language has been able to get an accepted solution.

Abhishek Mishra: 2011-10-06 04:28:34

what we have to use it here is it radix sort...

Adrian Nazco: 2011-07-30 15:58:09

i used C# default sort and i got runtime error, i have no idea about what else to do

Vaibhav Jain: 2011-07-11 09:19:46

Even on Ideone the code is running fine.What could be the reason for NZEC error ?


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