[BOJ] #1927 Minimum Heap (Python)

https://www.acmicpc.net/problem/1927↗

1. Python's built-in heapq module can solve this problem. Implementing the heap directly is another option.
2. When the input is not 0, push the value with heapq.heappush(list, data).
3. When the input is 0, check whether the list is empty; otherwise, pop with heapq.heappop(list) and print the result.

import heapq
import sys
 
H = []
n = int(sys.stdin.readline())
for i in range(n):
    k = int(sys.stdin.readline())
    if k == 0:
        if len(H) == 0:
            print(0)
            continue
        else:
            print(heapq.heappop(H))
    else:
        heapq.heappush(H, k)

1. Lines 5 and 7: reading data with input() caused a time limit exceeded error.
   • In Python, use readline through the sys module rather than input() for this input-reading step.

• The heapq module can implement a min-heap.
• Push with heapq.heappush(list, data).
• Pop with heapq.heappop(list).
• Attempting to pop from an empty list raises IndexError, so handle the empty case.
• Time complexity: O(NlogN)