## List Minimum (Hard)

View as PDF

Points: 5
Time limit: 0.4s
Racket 1.0s
Memory limit: 256M

Problem type
##### Brute Force Practice 1 — Hard Version

You have a list of unique numbers each no larger than . The size of the list is no greater than . 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?

#### Input Specification

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.

#### Output Specification

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

#### Sample Input

3
5
8
2

#### Sample Output

2
5
8

• commented on Feb. 29, 2024, 9:54 a.m.

This forced me to re-think my code from List Minimum (Easy), which is useful. There's a really simple way to solve this and I missed that on the easy version.

• commented on Nov. 19, 2020, 5:05 p.m.

I submitted a solution in java a TLE'd then did the same code in c++ and AC'd.

• commented on Sept. 14, 2020, 9:48 a.m. edited

Wait, is this not the same problem as List Minimum? The instructions are worded differently, but the problem seems the same. I even used the same code for both. Could someone explain this?

• commented on Nov. 2, 2021, 12:14 p.m. edited

Yeah, he's right.

My code for List Minimum is the same as the List Minimum (Hard)

This is rather random, given that the AC is smaller by at least 20%

• commented on Sept. 14, 2020, 1:58 p.m. edited

The constraints of the problems are different. The ones in this problem are a lot larger than the other one, so some solutions (not yours apparently) that may AC the other one may fail this one.

• commented on Sept. 25, 2020, 7:32 a.m.

like mine

• commented on Sept. 15, 2020, 4:55 a.m.

Ah, that clears things up, Thank you!

• commented on Oct. 23, 2016, 12:26 a.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))) <)))

• commented on Nov. 14, 2014, 3:57 p.m. edited

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

• commented on Oct. 9, 2018, 11:54 p.m.

Thx a lot