TSORT  Turbo Sort
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
Daniel Camacho:
20110224 15:41:40
Where is STL occurrence? Crazy Jhon jajajaj 

Jhon Camargo:
20110218 21:15:38
what is the meaning of STL? 

YatsukoYin:
20101229 18:42:23
WTF... always getting TLE on F#...


neerajcrespo:
20101224 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:
20100116 03:42:44
@MichaĆ Stolarczyk


anonymous:
20091012 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?


[Trichromatic] XilinX:
20090330 03:21:37
The 1st 5 is the number of numbers in the input file. 
Added by:  Roman Sol 
Date:  20050314 
Time limit:  2.700s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ZCon 