Submit | All submissions | Best solutions | Back to list |
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
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 |
hide comments
|
||||||||||
2011-02-24 15:41:40 Daniel Camacho
Where is STL occurrence? Crazy Jhon jajajaj |
||||||||||
2011-02-18 21:15:38 Jhon Camargo
what is the meaning of STL? |
||||||||||
2010-12-29 18:42:23 YatsukoYin
WTF... always getting TLE on F#... here is my code: <snip> why there is no coeff for different prog lang? Last edit: 2023-05-09 13:43:52 |
||||||||||
2010-12-24 03:05:34 neerajcrespo
why my stl sort is also giving TLE? i simple used function sort(v.begin(),v.end()); is it not enough? |
||||||||||
2010-01-16 03:42:44 Drew Saltarelli
@MichaĆ Stolarczyk yep, the STL sort is pretty fast :) |
||||||||||
2009-10-12 13:06:39 anonymous
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 |
||||||||||
2009-03-30 03:21:37 [Trichromatic] XilinX
The 1st 5 is the number of numbers in the input file. |