#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 5;
ll a[N];
ll prefix[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int t; cin >> t;
while(t--)
{
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a+1,a+1+n);
for(int i = 1; i <= n; i++) prefix[i] = prefix[i-1] + a[i];
ll ans = 0;
//注意i=0,原因是有可能只做第一种或者第二种处理方法
for (int i = 0; i <= k; i++)
{
ll maxans = prefix[n-(k-i)] - prefix[2*i];
ans = max(maxans,ans);
}
cout << ans << '\n';
}
return 0;
}