백준 1927번 최소 힙

문제 링크: https://www.acmicpc.net/problem/1927

Author: skysign

백준 1927번 최소 힙/main.py

@@ -0,0 +1,24 @@
+import sys
+from typing import List
+import heapq
+
+
+def solve():
+    N: int = int(sys.stdin.readline().strip())
+    heap: List[int] = []
+    heapq.heapify(heap)
+
+    for _ in range(N):
+        n: int = int(sys.stdin.readline().strip())
+
+        if n == 0:
+            if len(heap) == 0:
+                print(0)
+            else:
+                print(heapq.heappop(heap))
+        else:
+            heapq.heappush(heap, n)
+
+
+if __name__ == '__main__':
+    solve()

백준 1927번 최소 힙/test1.txt

@@ -0,0 +1,10 @@
+9
+0
+12345678
+1
+2
+0
+0
+0
+0
+32

백준 1927번 최소 힙/test1_answer.txt

@@ -0,0 +1,5 @@
+0
+1
+2
+12345678
+0

백준 1927번 최소 힙/test_main.py

@@ -0,0 +1,23 @@
+import sys
+from pathlib import Path
+from unittest import TestCase
+from main import solve
+
+
+class Test(TestCase):
+    def my_solve(self, testcase_input):
+        sys.stdin = open(testcase_input, 'r')
+        stdout = sys.stdout
+        sys.stdout = open('stdout.txt', 'w')
+        solve()
+        sys.stdout.close()
+        sys.stdout = stdout
+
+    def test_solve(self, testcase_number: str):
+        self.my_solve('test' + testcase_number + '.txt')
+        self.assertEqual(
+            Path('test' + testcase_number + '_answer.txt').read_text().strip(),
+            Path('stdout.txt').read_text().strip())
+
+    def test1_solve(self):
+        self.test_solve('1')