解题思路: 贪心点:先帮差值最小的完成积木作品
注意事项:
参考代码:
# 时间超限: 64 分 运行时间: 6803ms m = int(input()) for _ in range(m): n = int(input()) x = [] # 拥有的 #y = [] # 所需的 z = [] # 差值y-x for _ in range(n): a,b = map(int,input().split()) x.append(a) #y.append(b) z.append(b-a) flag = 0 # 设个标志位,0还在处理,1处理失败,2处理成功 free = 0 while flag == 0: if len(x) == 0: flag = 2 break minz = min(z) if free >= minz: minindex = z.index(minz) free += x[minindex] x.pop(minindex) #y.pop(minindex) z.pop(minindex) else: flag = 1 if flag == 2: print('YES') elif flag == 1: print('NO')
# 时间超限: 73 分 运行时间: 6609ms m = int(input()) for _ in range(m): n = int(input()) x = [] # 拥有的 z = [] # 差值y-x for _ in range(n): a,b = map(int,input().split()) x.append(a) z.append(b-a) free = 0 while 1: if len(x) == 0: print('YES') break minz = min(z) if free >= minz: minindex = z.index(minz) free += x[minindex] x.pop(minindex) z.pop(minindex) else: print('NO') break
# 正确: 100 分 运行时间: 4959ms m = int(input()) for _ in range(m): n = int(input()) x = [] # 拥有的 z = [] # 差值y-x for _ in range(n): a,b = map(int,input().split()) x.append(a) z.append(b-a) free = 0 while 1: if (not len(x)) or free >= max(z): print('YES') break minz = min(z) if free >= minz: minindex = z.index(minz) free += x[minindex] x.pop(minindex) z.pop(minindex) else: print('NO') break
# 正确: 100 分 运行时间: 3732ms m = int(input()) for _ in range(m): n = int(input()) x = [] # 拥有的 z = [] # 差值y-x for _ in range(n): a,b = map(int,input().split()) x.append(a) z.append(b-a) free = 0 maxz = max(z) while 1: if (not len(x)) or free >= maxz: print('YES') break minz = min(z) if free >= minz: minindex = z.index(minz) free += x[minindex] x.pop(minindex) z.pop(minindex) else: print('NO') break
0.0分
1 人评分