提出 #73899945

---

ソースコード 拡げる

import heapq

n, q = map(int, input().split())
a = list(map(int, input().split()))

hq = [(a[i], i+1) for i in range(n)]
heapq.heapify(hq)

for _ in range(q):
    k = int(input())
    b = list(map(int, input().split()))
    
    b_set = set(b)
    popped = []
    
    while hq[0][1] in b_set:
        popped.append(heapq.heappop(hq))
        
    print(hq[0][0])
    
    for p in popped:
        heapq.heappush(hq, p)

提出情報

ジャッジ結果