Submission #76466224

---

Source Code Expand

import heapq
from collections import defaultdict

N, K, M = map(int, input().split())

stones = defaultdict(list)

for i in range(N):
  a, b = map(int, input().split())
  heapq.heappush(stones[a], -b)

color_heap = []
for c in stones:
  heapq.heappush(color_heap, (stones[c][0], c))

ans = 0
for _ in range(M):
    _, c = heapq.heappop(color_heap)
    ans += -heapq.heappop(stones[c])

rest = []
for h in stones.values():
    rest.extend(h)
heapq.heapify(rest)

for _ in range(K - M):
    ans += -heapq.heappop(rest)

print(ans)

Submission Info

Judge Result