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
syed_tanveer: 2015-11-12 12:10:30

Counting Sort works fine.

sharif ullah: 2015-10-20 15:47:15

quick sort give me TLE
but STL sort ACCEPTED!!!

Eugene Che: 2015-08-09 18:39:22

Can I make iostream faster? It seems to be just so much slower than cstdio. Changing all my cin to scanf's and cout to printf's improved my program's speed by a factor of 10.

Arif Awate: 2015-08-05 08:41:25

quicksort with C++.. 0.34

candide: 2015-05-16 15:05:28

Native C qsort : 0.44s
inlined glibc qsort : 0.32s
Native C++ STL sort with vector and push_back : 0.32s
Native C++ STL sort with array : 0.29s
Native Python 2.7 or PyPy sort method : TLE

Last edit: 2016-03-05 00:08:34
Lehar: 2015-03-29 10:50:50

Count sort works :)

thelazycoder: 2015-02-16 18:17:53

Merge sort using vector :)

Abhinandan Agarwal: 2015-01-24 09:15:20

Quick sort and count sort both got accepted ..
Quick sort gave 0.43s while count sort gave .28s ... How to Further reduce the time ?

Amir Katkoot: 2014-10-07 15:37:11

Don't use cin/cout it cost me 2 TLEs...

SHIVAM DIXIT: 2014-10-03 11:24:59

counting sort gets accepted :P

Last edit: 2014-10-03 11:25:13

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