백준 1202번 보석 도둑 v2

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

Author: skysign

백준 1202번 보석 도둑 v2/main.py

@@ -0,0 +1,37 @@
+import sys
+import heapq
+
+
+def solve():
+    input = sys.stdin.readline
+    N, K = map(int, input().strip().split())
+    MVs = []
+    for _ in range(N):
+        Mi, Vi = map(int, input().strip().split())
+        heapq.heappush(MVs, [Mi, Vi])
+
+    bags = [int(input().strip()) for _ in range(K)]
+    bags.sort()
+
+    answer = 0
+    tmp = []
+
+    for bag in bags:
+        while MVs:
+            Mmin, Vmax = heapq.heappop(MVs)
+
+            if bag >= Mmin:
+                heapq.heappush(tmp, -Vmax)
+            else:
+                heapq.heappush(MVs, [Mmin, Vmax])
+                break
+
+        if tmp:
+            Vminus = heapq.heappop(tmp)
+            answer += -Vminus
+
+    print(answer)
+
+
+if __name__ == '__main__':
+    solve()

백준 1202번 보석 도둑 v2/test1.txt

@@ -0,0 +1,4 @@
+2 1
+5 10
+100 100
+11

백준 1202번 보석 도둑 v2/test1_answer.txt

@@ -0,0 +1 @@
+10

백준 1202번 보석 도둑 v2/test2.txt

@@ -0,0 +1,6 @@
+3 2
+1 65
+5 23
+2 99
+10
+2

백준 1202번 보석 도둑 v2/test2_answer.txt

@@ -0,0 +1 @@
+164

백준 1202번 보석 도둑 v2/test_main.py

@@ -0,0 +1,26 @@
+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')
+
+    def test2_solve(self):
+        self.test_solve('2')