[백준/Python] 1202 보석 도둑

www.acmicpc.net/problem/1202

import sys
from queue import PriorityQueue

n, k = map(int, sys.stdin.readline().split())
MV = []
C = []
for i in range(n):
    a,b = map(int, sys.stdin.readline().split())
    MV.append((a,b))
for i in range(k):
    C.append(int(sys.stdin.readline()))
MV.sort()
C.sort()
result = 0
index = 0
que = PriorityQueue()
for i in C:
    while index < n and MV[index][0] <= i:
        que.put(MV[index][1] * -1)
        index += 1
    if not que.empty():
        result += que.get()
print(-result)

설명은 일단 나중에 ..