Codeforces Round #760 (Div. 3) D. Array and Operations

题目链接：Problem - D - Codeforces

You are given an array aa of n integers, and another integer k such that 2k≤n.

You have to perform exactly k operations with this array. In one operation, you have to choose two elements of the array (let them be ai and aj; they can be equal or different, but their positions in the array must not be the same), remove them from the array, and add ⌊ai/aj⌋ to your score, where ⌊x/y⌋ is the maximum integer not exceeding x/y.

Initially, your score is 0. After you perform exactly k operations, you add all the remaining elements of the array to the score.

Calculate the minimum possible score you can get.

Input

The first line of the input contains one integer tt (1≤t≤500) — the number of test cases.

Each test case consists of two lines. The first line contains two integers nn and kk (1≤n≤100;