30选择+两个算法
算法:1 0
第二个感觉思路没错,但提交为0,骗点分都不让
第一题(python暴力):
t = int(input())
for i in range(t):
n, k = map(int, input().split())
aList = [int(j) for j in input().split()]
for j in range(k):
u, v = map(int, input().split())
aList[u-1] += 1
aList[v-1] -= 1
bList = aList[:]
bList.sort()
if aList == bList:
print('Yes')
else:
print('No')
#我的求职思考#