思路:
贪心法
for _ in range(int(input())):
n, k = map(int, input().split())
a = sorted([*map(int, input().split())],reverse=True)
m = sorted([*map(int, input().split())])
s = m.count(1)
ans = sum(a[:k])+sum(a[:s])
for i in m[s:]:
k += i-1
ans += a[k-1]
print(ans)