Submission #74772261

---

Source Code Expand

import sys

N, M = map(int, input().split())
R = list(map(int, input().split()))

graph = [[] for _ in range(N)]
for _ in range(M):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    graph[u].append(v)
    graph[v].append(u)

for i in range(N):
    graph[i].sort()

order = sorted(range(N), key=lambda i: -R[i])
used = [False] * N
ptr = [0] * N

for x in order:
    if used[x]:
        continue

    while used[graph[x][ptr[x]]]:
        ptr[x] += 1
    y = graph[x][ptr[x]]

    used[x] = True
    used[y] = True

    if x == 0:
        print(y + 1)
        sys.exit()
    if y == 0:
        print(x + 1)
        sys.exit()

Submission Info

Judge Result