Submission #30394690

---

Source Code Expand

import sys
sys.setrecursionlimit(10**7)

N,Q = list(map(int, input().split()))
X = list(map(int, input().split()))
from collections import defaultdict
edges = defaultdict(list)
for i in range(N-1):
    a,b = list(map(int, input().split()))
    a -= 1
    b -= 1
    edges[a].append(b)
    edges[b].append(a)

# 挿入 +
mxes = [[] for i in range(N)]
def TFS(u: int, p: int = -1):
    mxes[u].append(X[u])
    for v in edges[u]:
        if v==p: continue
        mxes[u] += TFS(v,u)
    mxes[u] = sorted(mxes[u], reverse=True)[:25]
    return mxes[u]

TFS(0)
#print(mxes)

for i in range(Q):
    v,k = list(map(int, input().split()))
    v -= 1
    k -= 1
    print(mxes[v][k])

Submission Info

Judge Result