大佬帮看看代码，第一题感觉和你的思路差不多，只过了60% t = int(input()) for i in range(t): n, k = map(int, input().split()) alist = [int(q) for q in input().split()] #print(alist) alist.sort() cnt = 0 flag = 0 res = 0 for w in range(n-1): if cnt >= k: print(res-(cnt-k)) flag = 1 break pre = alist[w] aft = alist[w+1] cur = aft-pre-1 cnt += cur res = pre + cur if flag == 0: print(alist[n-1]+k-cnt)