Submission #73914033

---

Source Code Expand

import sys
from collections import deque, defaultdict, Counter
from heapq import heappop, heappush, heapify
from itertools import product, combinations, accumulate, permutations, groupby
from math import sqrt, isqrt, comb, gcd

input = sys.stdin.readline
sys.setrecursionlimit(10**7)

DIR4 = [(1,0),(-1,0),(0,1),(0,-1)]
DIR8 = [(1,0),(-1,0),(0,1),(0,-1),(1,1),(1,-1),(-1,1),(-1,-1)]

INF = 10**18
YES,NO = "Yes", "No"
MOD = 10**9 + 7
MOD2  = 998244353

def ni(): return int(input())
def nm(): return map(int,input().split())
def nl(): return list(nm())

def si(): return input().strip()
def sm(): return si().split()
def sl(): return list(si())


def main():
    n,q = nm()
    a = nl()
    cnt = Counter(a)
    ans = min(a)
    aaa = ans
    aa = sorted(a)
    for _ in range(q):
        k = ni()
        b = nl()
        dels = []
        for i in b:
            i -= 1
            cnt[a[i]] -= 1
            if cnt[a[i]] == 0:
                dels.append(a[i])
        # print(cnt)
        for i in b:
            i -= 1
            cnt[a[i]] += 1
        # ansが消えたら、cnt[a[i]]ぶん進めた場所が答え
        dels.sort()
        i = 0
        j = 0
        while j < len(dels) and ans == dels[j]:
            i += cnt[dels[j]]
            ans = aa[i]
            j += 1
        print(ans)
        ans = aaa


if __name__ == '__main__':
    main()

Submission Info

Judge Result