import math
t = int(input())
for i in range(t):
n, k = map(int,input().split())
li = list(map(int,input().split()))
li.sort()
pex = [0]
for i in range(n):
pex.append(pex[-1]+li[i])
res = -math.inf
# i次处理1,k-i次处理2
for i in range(k+1):
res = max(res, pex[n-(k-i)]-pex[2*i])
print(res)
最大数组和
最新推荐文章于 2024-09-27 10:11:28 发布