List Minimum (Hard)

View as PDF

Submit solution

Points: 5
Time limit: 3.0s
Memory limit: 256M

Problem type

Brute Force Practice 1 — Hard Version

You have a list of unique numbers each no larger than 10^9. The size of the list is no greater than 10^5. You perform the following operation on the list repeatedly: take the minimum of the numbers, and remove it from the list. You stop when the list is empty.

In what order are the numbers removed?


The first line will have the size of the list.

Each line after that will be an element of the list. You are guaranteed no two elements are the same.


Print one line for each time the operation was performed: the number that was removed at that step.

Sample Input


Sample Output



  • -1
    Epic1Online  commented on Oct. 28, 2017, 11:13 p.m. edited

    Could anyone help me out? When I run my code on eclipse oxygen it works fine but when I submit it says invalid return and java.lang.NullPointerException

    EDIT: I fixed the issue, still not quite sure what caused it. However, even while using BufferedReader the last case is still giving me TLE, not sure what I can do about that...

    • 1
      wleung_bvg  commented on Oct. 29, 2017, 12:32 a.m. edited

      Reading the tips section at may provide some hints. (It's not reading the input that's causing the TLE).

  • 0
    FatalEagle  commented on Oct. 22, 2016, 8:26 p.m. edited

    To deal with input/output, you may want to add this to your program:

    (void (map displayln (my-sort (build-list (read) (lambda (x) (read))) <)))

  • 0
    FatalEagle  commented on Nov. 14, 2014, 10:57 a.m.

    For Java users getting TLE on the last case, reading this might be helpful.