Time limit: 3.0s
Memory limit: 64M
Brute Force Practice 1 - Hard Version
You have a list of unique numbers each no larger than ~10^8~. 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.
3 5 8 2
2 5 8