题解 | 小苯的比赛上分

import sys
import heapq

all_nums=sys.stdin.read().split()
ptr=0
n,m=int(all_nums[ptr]),int(all_nums[ptr+1])
ptr+=2
min_head=[]
max_num=-float('inf')
for _ in range(n):
    x=int(all_nums[ptr])
    heapq.heappush(min_head,x)
    ptr+=1
    if x>max_num:
        max_num=x
for _ in range(m):
    add_value=int(all_nums[ptr])
    ptr+=1
    min_s=heapq.heappop(min_head)
    min_s+=add_value
    heapq.heappush(min_head,min_s)
    if min_s>max_num:
        max_num=min_s
    print(max_num)