爱奇艺算法岗编程题ak【python版】

lst = input().split()
N = int(lst[0])
M = int(lst[1])
P = int(lst[2])
foodlst = list(map(int, input().split()))
for i in range(M):
  lst = input().split()
  if lst[0] == 'A':
    foodlst[int(lst[1]) - 1] += 1
  else:
    foodlst[int(lst[1]) - 1] -= 1
b = foodlst[:]
b.sort(reverse = True)
print(str(b.index(foodlst[P-1]) + 1))

N = int(input())
noodles = []
for i in range(N):
  lst = input().split()
  a = int(lst[0])
  b = int(lst[1])
  if a < b:
    noodles += [[a,b]]
  else:
    noodles += [[b,a]]
noodles.sort(key = lambda x:x[1])
cnt = 0
start = -1000
for n in noodles:
  if n[0] >= start:
    cnt += 1
    start = n[1]
print(cnt)