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
Vaibhav Jain: 2011-07-11 09:12:16

My Java code is running fine on Eclipse but here it gives NZEC again and again. I have named the class Main and everything else appears correct.Does anybody give me an idea of what might be wrong?

ndduy1995: 2011-06-28 21:48:01

You can use distribution Counting in O(n) :D

ANANT AGARWAL: 2011-05-27 12:06:06

for those whose STL sort is giving TLE try to use faster I/O methods

Piotr Dzienis: 2011-03-01 20:06:57

i used vector tables and sort from stl library and i have acc

Daniel Camacho: 2011-02-24 15:41:40

Where is STL occurrence? Crazy Jhon jajajaj

Jhon Camargo: 2011-02-18 21:15:38

what is the meaning of STL?

YatsukoYin: 2010-12-29 18:42:23

WTF... always getting TLE on F#...
here is my code: http://paste.ubuntu.com/548593/

why there is no coeff for different prog lang?

neerajcrespo: 2010-12-24 03:05:34

why my stl sort is also giving TLE? i simple used function sort(v.begin(),v.end()); is it not enough?

Drew Saltarelli: 2010-01-16 03:42:44

@MichaƂ Stolarczyk

yep, the STL sort is pretty fast :)

anonymous: 2009-10-12 13:06:39

I am using an c++ implementation of a rather optimized version of quicksort and still getting TLE. Am I doing something wrong or is just quicksort not effective enough?

[EDIT]
Ok, I am ... amused. My implementation failed, but when I used better input/output methods and standard sort from STL, it got accepted instantly. One more time, STL rules.

Last edit: 2009-10-12 13:22:26

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