Sorting 2x10^5 entries

Revision en2, by nitishch, 2015-08-12 09:51:53

This is my submission to the problem 557B.

The only computation intensive thing I do is sort an array which can have atmost 10^5 entries. This is supposed to take < 1s. But I get TLE error if the array size is 10^5. Why does this happen?

Tags sorting, tle

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English nitishch 2015-08-12 09:51:53 29 Tiny change: 'TLE error on big input. Why does' -> 'TLE error if the array size is 10^5. Why does'
en1 English nitishch 2015-08-12 09:50:27 358 Initial revision (published)