ABC160 E - Red and Green Apples

提出

code: python

import heapq

x, y, a, b, c = map(int, input().split())

for i in pqr:

i.sort(reverse=True)

heapq.heapify(eat)

min_num = heapq.heappop(eat)

if (i > min_num):

heapq.heappush(eat, i)

else:

heapq.heappush(eat, min_num)

break

print(sum(eat))