Codeforces Educational Codeforces Round 169 (Rated for Div. 2) C. Splitting Items

C. Splitting Items

time limit per test: 2 seconds

memory limit per test: 256 megabytes

Alice and Bob have n items they'd like to split between them, so they decided to play a game. All items have a cost, and the i-th item costs ai. Players move in turns starting from Alice.

In each turn, the player chooses one of the remaining items and takes it. The game goes on until no items are left.

Let's say that A is the total cost of items taken by Alice and B is the total cost of Bob's items. The resulting score of the game then will be equal to A−B.

Alice wants to maximize the score, while Bob wants to minimize it. Both Alice and Bob will play optimally.

But the game will take place tomorrow, so today Bob can modify the costs a little. He can increase the costs ai of several (possibly none or all) items by an integer value (possibly, by the same value or by different values for each item). However, the total increase must be less than or equal to k. Otherwise, Alice may suspect something. Note that Bob can't decrease costs, only increase.

What is the minimum possible score Bob can achieve?

Input

The first line contains a single integer t (1≤t≤5000) — the number of test cases. Then t cases follow.

The first line of each test case contains two integers n and k (2≤n≤2⋅; 0≤k≤) — the number of items and the maximum total increase Bob can make.

The second line of each test case contains n integers a1,a2,…,an (1≤ai≤) — the initial costs of the items.

It's guaranteed that the sum of n over all test cases doesn't exceed 2⋅.

Output

For each test case, print a single integer — the minimum possible score A−B after Bob increases the costs of several (possibly none or all) items.

Example

Input

4

2 5

1 10

3 0

10 15 12

4 6

3 1 2 4

2 4

6 9

Output

4

13

0

0

Note

In the first test case, Bob can increase a1 by 5, making costs equal to [6,10]. Tomorrow, Alice will take 10 and Bob will take 6. The total score will be equal to 10−6=4, and it's the minimum possible.

In the second test case, Bob can't change costs. So the score will be equal to (15+10)−12=13, since Alice will take 15, Bob will take 12, and Alice — 10.

In the third test case, Bob, for example, can increase a1 by 1, a2 by 3, and a3 by 2. The total change is equal to 1+3+2≤6 and costs will be equal to [4,4,4,4]. Obviously, the score will be equal to (4+4)−(4+4)=0.

In the fourth test case, Bob can increase a1 by 3, making costs equal to [9,9]. The score will be equal to 9−9=0.

【思路分析】

博弈。最优策略下，每次每人都拿当前元素中最大的，故先需要排序。分类讨论，n为偶数时，A-B可能为0；n为奇数时，A-B不可能为0，最小为a[0]。对该两种情况模拟即可。

#include <iostream>
#include <vector>
#include <unordered_map>
#include <map>
#include <cmath>
#include <algorithm>
#include <climits>
#include <stack>
#include <cstring>
#include <iomanip>
#include <set>

#define i64 long long

using namespace std;

i64 mod = 998244353;

void solve() {
    i64 n,k;
    cin>>n>>k;
    i64 a[n];
    for (int i = 0; i < n; ++i) cin>>a[i];
    sort(a,a+n);
    i64 cnta = 0,cntb = 0;
    if (n&1){
        for (int j = 2; j < n; j+=2) cnta+=a[j];
        for (int j = 1; j < n; j+=2) cntb+=a[j];
        if (cntb+k>=cnta) cout<<a[0]<<endl;
        else cout<<cnta-cntb-k+a[0]<<endl;
    } else {
        for (int j = 1; j < n; j+=2) cnta+=a[j];
        for (int j = 0; j < n; j+=2) cntb+=a[j];
        if (cntb+k>=cnta) cout<<0<<endl;
        else cout<<cnta-cntb-k<<endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}