python 代码

n,k = map(int,input().split())
r = [0] + list(map(int,input().split()))
f = [0 for i in range(n + 1)]
c = r[:]
c.sort()

for i in range(k):
    a,b = map(int,input().split())
    if r[a] > r[b]:
        f[a] = f[a] + 1
    elif r[b] > r[a]:
        f[b] = f[b] + 1
for i in range(1,n + 1):
    left,right = 0,n
    while left < right:
        mid = (left + right + 1) // 2
        if c[mid] >= r[i]:
            right = mid - 1
        else:
            left = mid
    ans = right - f[i]
    print(ans,end = ' ')
# -----------------------------------暴力-----------------------------------------------#
# n,k = map(int,input().split())
# r = [0] + list(map(int,input().split()))
# f = [0 for i in range(n + 1)]
# g = [[] for i in range(n + 1)]
# for i in range(k):
#     a,b = map(int,input().split())
#     if r[a] > r[b]:
#         f[a] = f[a] - 1
#     elif r[a] < r[b]:
#         f[b] = f[b] - 1
# for i in range(1,n + 1):
#     for j in range(1,n + 1):
#         if r[j] < r[i]:
#           f[i] = f[i] + 1
# for i in range(1,n + 1):
#     if f[i] < 0:
#         f[i] = 0
# print(" ".join(map(str,f[1:])))