Problem:
 Score : 300 points    Problem Statement There are N observatories in AtCoder Hill, called Obs. 1 , Obs. 2 , ... , Obs. N . The elevation of Obs. i is H_i .
There are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j .  Obs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.
Note that Obs. i is also good when no observatory can be reached from Obs. i using just one road.  How many good observatories are there?      Constraints  2 \leq N \leq 10^5  1 \leq M \leq 10^5  1 \leq H_i \leq 10^9  1 \leq A_i,B_i \leq N  A_i \neq B_i  Multiple roads may connect the same pair of observatories.  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  M  H_1  H_2  ...  H_N  A_1  B_1  A_2  B_2  :  A_M  B_M       Output Print the number of good observatories.        Sample Input 1 4 3
1 2 3 4
1 3
2 3
2 4      Sample Output 1 2    From Obs. 1 , you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3 , so Obs. 1 is not good.    From Obs. 2 , you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3 , so Obs. 2 is not good.    From Obs. 3 , you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2 , so Obs. 3 is good.    From Obs. 4 , you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2 , so Obs. 4 is good.    Thus, the good observatories are Obs. 3 and 4 , so there are two good observatories.       Sample Input 2 6 5
8 6 9 1 2 1
1 3
4 2
4 3
4 6
4 6      Sample Output 2 3

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))

res = [1] * N

for i in range(M):
  A, B = map(int, input().split())
  if H[A-1] > H[B-1]:
    res[B-1] = 0
  elif H[A-1] < H[B-1]:
    res[A-1] = 0
  else:
    res[A-1] = 0
    res[B-1] = 0


cnt = 0
for i in res:
  if i == 1:
    cnt += 1
    
print(cnt)

Solution (Python):
n,m=map(int,input().split())
h=list(map(int,input().split()))
ab=[[]*n for _ in range(n)]
for i in range(m):
    a,b=map(int,input().split())
    ab[a-1].append(b-1)
    ab[b-1].append(a-1)
ans=0
for i in range(n):
    if ab[i]:
        flg=0
        for j in ab[i]:
            if h[i]<=h[j]:
                flg=1
                break
        if flg==0:
            ans+=1
    else:
        ans+=1
print(ans)

Solution (Python):
N,M=map(int,input().split())
H=list(map(int,input().split()))
a=[[] for _ in range(N)]
ans=0
for i in range(M):
    A,B=map(int,input().split())
    a[B-1].append(A-1)
    a[A-1].append(B-1)
for i in range(N):
    q=a[i]
    while q:
        b=q.pop()
        if H[i]<=H[b]:
            ans+=1
            break
print(N-ans)

Solution (Python):
n,m=map(int,input().split())
H=list(map(int,input().split()))
c=[]
for i in range(n):
    c.append(0)

for i in range(m):
    a,b=map(int,input().split())
    if H[a-1]>H[b-1]:
        c[b-1]+=1
    elif H[a-1]<H[b-1]:
        c[a-1]+=1
    else:
        c[a-1]+=1
        c[b-1]+=1
s=0
for i in range(n):
    if c[i]==0:
        s+=1

print(s)

Solution (Python):

N,M = map(int,input().split())
H = list(map(int,input().split()))
AB = [list(map(int,input().split())) for i in range(M)]

on = [[] for i in range(N)]
for ab in AB:
    u,v = ab
    if v-1 not in on[u-1]:
        on[u-1].append(v-1)
    if u-1 not in on[v-1]:
        on[v-1].append(u-1)
    
ans = 0
for i in range(N):
    nh = H[i]
    non = on[i]
    
    flag = True
    for o in non:
        if H[o] >= nh:
            flag = False
            break
            
    if flag:
        ans+=1
        
print(ans)

Solution (Python):



n, m = list(map(int, input().split()))
h = list(map(int, input().split()))

best = [1 for i in range(n)]
for i in range(m):
    a, b = list(map(int, input().split()))
    if h[a-1] <= h[b-1]:
        best[a-1] = 0
    if h[b-1] <= h[a-1]:
        best[b-1] = 0


print(sum(best))

Solution (Python):
n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = []
for i in range(m):
    ab.append(list(map(int, input().split())))
keys = [i+1 for i in range(n)]
good_or_bad = {key:0 for key in keys} 
for i in range(m):
    a = ab[i][0]
    b = ab[i][1]
    if h[a-1]>h[b-1]:
        good_or_bad[b] = 1
    elif h[a-1]<h[b-1]:
        good_or_bad[a] = 1
    elif h[a-1]==h[b-1]:
        good_or_bad[a] = 1
        good_or_bad[b] = 1
cnt = 0
for key, item in good_or_bad.items():
    if item == 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1 for i in range(n)]
for i in range(m):
    a,b = map(int, input().split())
    if h[a-1] < h[b-1]:
        ans[a-1] = 0
    elif h[a-1] > h[b-1]:
        ans[b-1] = 0
    else:
        ans[a-1] = 0
        ans[b-1] = 0


print(sum(ans))

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))

l = []

for i in range(M):
    a, b = map(int, input().split())
    l.append([a-1, b-1])
    l.append([b-1, a-1])


l = sorted(l)

dai = [True for _ in range(N)]

for i in l:
    if H[i[0]] <= H[i[1]]:
        dai[i[0]] = False

ans = 0
for i in dai:
    if i:
        ans += 1

print(ans)

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))

R = [True]*N

for i in range(M):
    An, Bn = map(int, input().split())
    if H[An-1] <= H[Bn-1]:
        R[An-1] = False
    if H[Bn-1] <= H[An-1]:
        R[Bn-1] = False

print(R.count(True))

Solution (Python):

import sys


def solve(N: int, M: int, H: "List[int]", A: "List[int]", B: "List[int]"):
    ng = set()
    for a, b in zip(A, B):
        if H[a-1] < H[b-1]:
            ng.add(a)
        elif H[b-1] < H[a-1]:
            ng.add(b)
        else:
            ng.add(a)
            ng.add(b)
    print(N - len(ng))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    M = int(next(tokens))  
    H = [int(next(tokens)) for _ in range(N)]  
    A = [int()] * (M)  
    B = [int()] * (M)  
    for i in range(M):
        A[i] = int(next(tokens))
        B[i] = int(next(tokens))
    solve(N, M, H, A, B)

if __name__ == '__main__':
    main()

Solution (Python):
N, M = map(int, input().split())
H_list = list(map(int, input().split()))

temp = [0 for i in range(N)]
for i in range(M):
    A, B = map(int, input().split())
    if H_list[A - 1] < H_list[B - 1]:
        temp[A - 1] = -1
    elif H_list[A - 1] == H_list[B - 1]:
        temp[A - 1] = -1
        temp[B - 1] = -1
    else:
        temp[B - 1] = -1

count = 0
for i in temp:
    if i == 0:
        count += 1
print(count)

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = [0 for _ in range(M)]
for i in range(M):
    AB[i] = list(map(int, input().split()))

flg = [True for _ in range(N)]
for x in AB:
    if H[x[0] - 1] < H[x[1] - 1]:
        flg[x[0] - 1] = False
    elif H[x[0] - 1] > H[x[1] - 1]:
        flg[x[1] - 1] = False
    else:
        flg[x[0] - 1] = False
        flg[x[1] - 1] = False
print(flg.count(True))

Solution (Python):
import numpy as np
n,m = map(int,input().split())
h_ls = list(map(int, input().split()))
isgood_ls = [1] * n

for i in range(m):
    a,b = map(int,input().split())
    if h_ls[a-1] > h_ls[b-1]:
        isgood_ls[b-1] = 0
    elif h_ls[a-1] < h_ls[b-1]:
        isgood_ls[a-1] = 0
    else:
        isgood_ls[b-1] = 0
        isgood_ls[a-1] = 0

print(sum(isgood_ls))

Solution (Python):
n,m = map(int, input().split())
h = list(map(int, input().split()))
arr = [[] for i in range(n)]
for i in range(m):
  a,b = map(int, input().split())
  arr[a-1].append(b-1)
  arr[b-1].append(a-1)
res = 0
for i in range(n):
  flg = 0
  for j in range(len(arr[i])):
    if h[i] <= h[arr[i][j]]:
      flg = 1
  if flg == 0:
    res += 1
print(res)

Solution (Python):
n, m = map(int, input().split())
h = list(map(int, input().split()))

ans = [1 for i in range(len(h))]
for j in range(m):
    a, b = map(int, input().split())
    if h[a-1] <= h[b-1]:
        ans[a-1] = 0
    if h[b-1] <= h[a-1]:
        ans[b-1] = 0

print(sum(ans))

Solution (Python):
n,m=map(int,input().split())
H=list(map(int,input().split()))
G=[[]for i in range(n)]
for i in range(m):
  a,b=map(int,input().split())
  a=a-1
  b=b-1
  G[a].append(b)
  G[b].append(a)
ans=0
for i in range(n):
  f=0
  for j in range(len(G[i])):
    if H[i]<=H[G[i][j]]:
      f=1
  if f==0:
    ans=ans+1
print(ans)

Solution (Python):
n,m = map(int, input().split())
h = list(map(int, input().split()))
a = [0]*m
b = [0]*m
for i in range(m):
    a[i],b[i] = map(int, input().split())
good = [1]*n
for i in range(m):
    if h[a[i] - 1] > h[b[i] - 1]:
        good[b[i] - 1] = 0
    if h[a[i] - 1] < h[b[i] - 1]:
        good[a[i] - 1] = 0
    if h[a[i] - 1] == h[b[i] - 1]:
        good[a[i] - 1] = 0
        good[b[i] - 1] = 0
print(sum(good))

Solution (Python):
N,M=map(int,input().split())
Hs=list(map(int,input().split()))
results=[True]*N
for m in range(M):
    s,e=map(int,input().split())
    if Hs[s-1] <= Hs[e-1]:
        results[s-1] = False
    if Hs[s-1] >= Hs[e-1]:
        results[e-1] = False

print(sum(results))

Solution (Python):
n,m = map(int,input().split())
h = list(map(int,input().split()))
a = list(list(map(int,input().split())) for i in range(m))

c = 0
q = list([0] for i in range(n))
for j,k in a:
  q[k-1].append(h[j-1])
  q[j-1].append(h[k-1])
for i in range(n):
  a = h[i]
  if a>max(q[i]):
    c += 1
print(c)

Solution (Python):
N,M = map(int,input().split())
H = list(map(int,input().split()))
ten = [True]*N
for i in range(M):
    A,B = map(int,input().split())
    if H[A-1] <= H[B-1]:
        ten[A-1] = False
    if H[A-1] >= H[B-1]:
        ten[B-1] = False
res = 0
for i in ten:
    if i:
        res += 1
print(res)

Solution (Python):
N, M = map(int, input().split())
H = [None] + list(map(int, input().split()))
r = [None] + [[] for _ in range(N)]
for _ in range(M):
    Ai, Bi = map(int, input().split())
    r[Ai].append(Bi)
    r[Bi].append(Ai)

ans = 0
for i in range(1, N + 1):
    for j in r[i]:
        if H[j] >= H[i]:
            break
    else:
        ans += 1

print(ans)

Solution (Python):
n, m = map(int, input().split())
h = list(map(int, input().split()))
rela = [[] for i in range(n)]
for i in range(m):
    ai, bi = list(map(int, input().split()))
    
    ai -= 1
    bi -= 1
    rela[ai].append(bi)
    rela[bi].append(ai)
    
ans = 0
for i in range(n):
    flag = True
    for j in rela[i]:
        if h[j] >= h[i]:
            flag = False
    if flag:
        ans += 1
print(ans)

Solution (Python):
n, m = map(int, input().split())
h = list(map(int, input().split()))
x = [0] * n

for i in range(m):
    a, b = map(int, input().split())
    if h[a - 1] > h[b - 1]:
        if x[a - 1] != -1:
            x[a - 1] = 1
        x[b - 1] = -1
    elif h[a - 1] < h[b - 1]:
        x[a - 1] = -1
        if x[b - 1] != -1:
            x[b - 1] = 1
    else:
        x[a - 1] = -1
        x[b - 1] = -1

print(n - x.count(-1))

Solution (Python):
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi

MOD = 10 ** 9 + 7
INF = 10 ** 18

N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]

graph = [[] for _ in range(N + 1)]

for a, b in AB:
    graph[a].append(b)
    graph[b].append(a)


ans = 0
for i in range(1, N + 1):
    tmp = H[i - 1]
    flag = 1
    for g in graph[i]:
        if tmp <= H[g - 1]:
            flag = 0
    if flag:
        
        ans += 1
print(ans)

Solution (Python):
N, M = map(int, input().split())
HFlag = [True] * N
H = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(M)]
for x in ab:
    if H[x[0] - 1] <= H[x[1] - 1]:
        HFlag[x[0] - 1] = False
    if H[x[0] - 1] >= H[x[1] - 1]:
        HFlag[x[1] - 1] = False
print(HFlag.count(True))

Solution (Python):
def main():
    N, M = map(int, input().split())
    H = list(map(int, input().split()))
    edge =  [[] for _ in range(N)]
    for _ in range(M):
        A, B = map(int, input().split())
        A -= 1
        B -= 1
        edge[A].append(H[B])
        edge[B].append(H[A])
    ans = 0
    for i in range(N):
        if not edge[i]:
            ans += 1
        elif H[i] > max(edge[i]):
            ans += 1

    print(ans)
        


    

        


if __name__ == "__main__":
    main()

Solution (Python):
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))

a = []
b = []
for i in range(m):
    ai, bi = list(map(int, input().split()))
    a.append(ai)
    b.append(bi)

losers = []

for i in range(m):
    if h[a[i]-1] > h[b[i]-1]:
        losers.append(b[i])
    elif h[a[i]-1] < h[b[i]-1]:
        losers.append(a[i])
    else:
        losers.append(a[i])
        losers.append(b[i])

l = len(set(losers))
print(n-l)

Solution (Python):
N,M = map(int,(input().split()))
H = list(map(int,(input().split())))
line = [[] for _ in range(N)]
for i in range(M):
    a,b = map(int,(input().split()))
    line[a-1].append(b-1)
    line[b-1].append(a-1)

for i in range(N):
    line[i] = set(line[i])

ans = 0
for i in range(N):
    if line[i] == set():
        ans += 1
    else:
        for tower in line[i]:
            if H[i] <= H[tower]:
                break
        else:
            ans += 1

print(ans)

Solution (Python):
from operator import itemgetter
n,m=map(int,input().split())
h=list(map(int,input().split()))
t=[0]*n
for _ in range(m):
  a,b=map(int,input().split())
  a-=1
  b-=1
  if h[a]<=h[b]:
    t[a]=1
  if h[b]<=h[a]:
    t[b]=1
print(n-sum(t))

Solution (Python):
N,M = map(int,input().split())
H = list(map(int,input().split()))
"""
G = [[] for _ in range(N)]
for _ in range(M):
    a,b = map(int,input().split())
    if b-1 not in G[a-1]:
        G[a-1].append(b-1)
    if a-1 not in G[b-1]:
        G[b-1].append(a-1)
print(G)
"""

G = [1]*N
for _ in range(M):
    a,b = map(int,input().split())
    if H[a-1] > H[b-1]:
        G[b-1] = 0
    elif H[a-1] < H[b-1]:
        G[a-1] = 0
    else:
        G[a-1] = 0
        G[b-1] = 0
    
print(sum(G))

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    
    N, M = R()
    H = R()
    l = [0] * N
    for m in range(M):
        a, b = R()
        if H[a-1] >= H[b-1]:
            l[b-1] += 1
        if H[b-1] >= H[a-1]:
            l[a-1] += 1
    ans = 0
    for ll in l:
        if ll == 0:
            ans += 1
    print(ans)


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
n, m = map(int, input().split())
h = list(map(int, input().split()))
g = [1]*n
for i in range(m):
  a, b = map(int, input().split())
  if h[a-1] <= h[b-1]:
    g[a-1] = 0
  if h[a-1] >= h[b-1]:
    g[b-1] = 0
print(g.count(1))

Solution (Python):
N, M = map(int, input().split())

highs = list(map(int, input().split()))

loads = [set([]) for _ in range(N)]

for _ in range(M):
    a, b = map(int, input().split())
    loads[a - 1].add(b - 1)
    loads[b - 1].add(a - 1)


count = 0
for i, tower_loads in enumerate(loads):
    highest = True
    for load in tower_loads:
        if highs[i] <= highs[load]:
            highest = False
            break
    if highest:
        
        count += 1
print(count)

Solution (Python):
N,M = map(int,input().split())
H = list(map(int,input().split()))
high = [1] * N

for i in range(M):
  A,B = map(int,input().split())
  if H[A-1] < H[B-1]:
    high[A-1] = 0
  elif H[A-1] > H[B-1]:
    high[B-1] = 0
  else:
    high[A-1] = 0
    high[B-1] = 0

print(sum(high))

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))
li = []
count = 0
for i in H:
    li.append([i])
for i in range(M):
    s1, s2 = map(int, input().split())
    li[s1-1].append(s2)
    li[s2-1].append(s1)
for i in range(len(li)):
    flag = 1
    for j in range(1, len(li[i])):
        if li[i][0] <= H[li[i][j]-1]:
            flag = 0
    if flag == 1:
        count += 1
print(count)

Solution (Python):
N, M = map(int, input().split())
H = list(map(int, input().split()))

h = []
for i in H:
    h.append(i)
for i in range(M):
    a, b = map(int, input().split())
    if h[a-1] <= H[b-1] and h[a-1] != -1:
        h[a-1] = -1
    if h[b-1] <= H[a-1] and h[b-1] != -1:
        h[b-1] = -1

ans = N
for i in h:
    if i == -1:
        ans -= 1

print(ans)

Solution (Python):
N, M = map(int, input().split())

H = list(map(int, input().split()))

road = [[] for _ in range(N)]

for _ in range(M):
    a, b = map(int, input().split())
    road[a-1].append(H[b-1])
    road[b-1].append(H[a-1])

ans = 0
for i in range(N):
    if not road[i]:
        ans += 1
    elif H[i] > max(road[i]):
        ans += 1

print(ans)

Solution (Python):
def resolve():
    N, M = map(int, input().split())
    H = list(map(int, input().split()))
    g = [1] * N
    for _ in range(M):
        a, b = map(int, input().split())
        a -= 1
        b -= 1
        if H[a] <= H[b]:
            g[a] = 0
        if H[b] <= H[a]:
            g[b] = 0

    print(sum(g))
resolve()

Solution (Python):
N,M = map(int,input().split())
H = list(map(int,input().split()))
lose = []
for i in range(M):
    A,B = map(int,input().split())
    if(H[A-1]>H[B-1]):
        loser = B
    elif(H[B-1]>H[A-1]):
        loser= A
    else:
        lose.append(A)
        lose.append(B)
        continue
    lose.append(loser)
set_lose = set(lose)
print(N-len(set_lose))

Solution (Python):

''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _i(): return int(sys.stdin.readline().strip())


def _ia(): return map(int, sys.stdin.readline().strip().split())


def main():
    n, m = _ia()
    h = list(_ia())
    adj = [[] for _ in range(n)]
    for _ in range(m):
        a, b = _ia()
        adj[a-1].append(b-1)
        adj[b-1].append(a-1)
    ans = 0
    for i in range(n):
        hi = h[i]
        f = True
        for j in adj[i]:
            hj = h[j]
            if hi <= hj:
                f = False
                break
        if f:
            ans += 1
    return ans


if __name__ == "__main__":
    print(main())

Solution (Python):
N, M = map(int, input().split())
Hs = list(map(int, input().split()))

lis = [[-1] for _ in range(N)]

for _ in range(M):
    A, B = map(int, input().split())
    lis[A-1].append(B-1)
    lis[B-1].append(A-1)

ans = 0
for i in range(N):
    L = lis[i]
    H = Hs[i]
    flg = True
    for j in L:
        if j==-1:
            continue
        if H<=Hs[j]:
            flg = False
            break
    if flg:
        ans += 1
print(ans)