description: You are given an array a 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 a_i and a_j; they can be equal or different, but their positions in the array must not be the same), remove them from the array, and add ⌊ (a_i)/(a_j) ⌋ 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 t (1 ≤ t ≤ 500) — the number of test cases.
  
  Each test case consists of two lines. The first line contains two integers n and k (1 ≤ n ≤ 100; 0 ≤ k ≤ ⌊ n/2 ⌋).
  
  The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2 ⋅ 10^5).
  
  Output
  
  Print one integer — the minimum possible score you can get.
  
  Example
  
  Input
  
  
  5
  7 3
  1 1 1 2 1 3 1
  5 1
  5 5 5 5 5
  4 2
  1 3 3 7
  2 0
  4 2
  9 2
  1 10 10 1 10 2 7 10 3
  
  
  Output
  
  
  2
  16
  0
  6
  16
  
  Note
  
  Let's consider the example test.
  
  In the first test case, one way to obtain a score of 2 is the following one:
  
    1. choose a_7 = 1 and a_4 = 2 for the operation; the score becomes 0 + ⌊ 1/2 ⌋ = 0, the array becomes [1, 1, 1, 1, 3]; 
    2. choose a_1 = 1 and a_5 = 3 for the operation; the score becomes 0 + ⌊ 1/3 ⌋ = 0, the array becomes [1, 1, 1]; 
    3. choose a_1 = 1 and a_2 = 1 for the operation; the score becomes 0 + ⌊ 1/1 ⌋ = 1, the array becomes [1]; 
    4. add the remaining element 1 to the score, so the resulting score is 2. 
  
  
  
  In the second test case, no matter which operations you choose, the resulting score is 16.
  
  In the third test case, one way to obtain a score of 0 is the following one:
  
    1. choose a_1 = 1 and a_2 = 3 for the operation; the score becomes 0 + ⌊ 1/3 ⌋ = 0, the array becomes [3, 7]; 
    2. choose a_1 = 3 and a_2 = 7 for the operation; the score becomes 0 + ⌊ 3/7 ⌋ = 0, the array becomes empty; 
    3. the array is empty, so the score doesn't change anymore. 
  
  
  
  In the fourth test case, no operations can be performed, so the score is the sum of the elements of the array: 4 + 2 = 6.
solution: import java.io.*;
  import java.util.*;
  import java.lang.Math;
  import static java.lang.Math.max;
  import static java.lang.Math.min;
  import static java.lang.Math.abs;
  
  
  
  public class Main {
  
  
       static PrintWriter pw;
       static Scanner sc;
       static StringBuilder ans;
       static long mod = 1000000000+7;
       static int MAX_I = Integer.MAX_VALUE;
       static int MIN_I = Integer.MIN_VALUE;
       static long MAX_L = Long.MAX_VALUE;
       static long MIN_L = Long.MIN_VALUE;
  
       static void pn(final Object arg) {      pw.print(arg);   pw.flush();      }     
        
  
       /*-------------- for input in an value ---------------------*/
       static int ni()     { return sc.nextInt();       }
       static long nl()    { return sc.nextLong();      }
       static double nd()  { return sc.nextDouble();    }
       static String ns()  { return sc.next();          }
       static String nLine() { return sc.nextLine(); }
  
  
       static void ap(int arg)           { ans.append(arg); }
       static void ap(long arg)          { ans.append(arg); }
       static void ap(String arg)        { ans.append(arg); }
       static void ap(StringBuilder arg) { ans.append(arg); }
       static void yes() { ap("Yes\n"); }
       static void no()  { ap("No\n"); }        
  
  
       /* for Dubuggin */
       static void printArr(int ar[], int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar[i]+ " ");    ap("\n"); }
       static void printArr(long ar[], int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar[i]+ " ");    ap("\n"); }     
       static void printArr(String ar[], int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar[i]+ " ");    ap("\n"); }     
       static void printIntegerList(List<Integer> ar, int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar.get(i)+ " ");    ap("\n"); }
       static void printLongList(List<Long> ar, int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar.get(i)+ " ");    ap("\n"); }     
       static void printStringList(List<String> ar, int st , int end) {   for(int i = st; i<=end; i++ )    ap(ar.get(i)+ " ");    ap("\n"); }     
  
  
       /*-------------- for input in an array ---------------------*/
       static void readArray(int arr[]){
            for(int i=0; i<arr.length; i++)arr[i] = ni();
       }
       static void readArray(long arr[]){
            for(int i=0; i<arr.length; i++)arr[i] = nl(); 
       }
       static void readArray(String arr[]){
            for(int i=0; i<arr.length; i++)arr[i] = ns(); 
       }    
       static void readArray(double arr[]){
            for(int i=0; i<arr.length; i++)arr[i] = nd();
       }
  
  
       /*-------------- File vs Input ---------------------*/
       static void runFile() throws Exception {
            sc = new Scanner(new FileReader("input.txt"));
            pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
       }
       static void runIo() throws Exception  {
            pw =new PrintWriter(System.out);
            sc = new Scanner(System.in);
       }
  
  
       static boolean isPowerOfTwo (long x) { return x!=0 && ((x&(x-1)) == 0);}
  
       static long gcd(long a, long b) { if (b == 0) return a;     return gcd(b, a % b); }
  
       static long nCr(long n, long r) { // Combinations
            if (n < r)
                 return 0;
            if (r > n - r) { // because nCr(n, r) == nCr(n, n - r)
                 r = n - r;
            }
            long ans = 1L;
            for (long i = 0; i < r; i++) {
                 ans *= (n - i);
                 ans /= (i + 1);
            }
            return ans;
       }          
  
       static int countDigit(long n){return (int)Math.floor(Math.log10(n) + 1);} 
  
       static boolean isPrime(long n) { 
            if (n <= 1) return false; 
            if (n <= 3) return true; 
            if (n % 2 == 0 || n % 3 == 0) return false; 
  
            for (long i = 5; i * i <= n; i = i + 6) 
            if (n % i == 0 || n % (i + 2) == 0) 
                 return false; 
  
            return true; 
       }         
  
       static boolean sv[] = new boolean[10002];
        
  
       static void seive() {
  
            //true -> not prime
            // false->prime
  
            sv[0] = sv[1] = true; 
            sv[2] = false;
  
            for(int i = 0; i< sv.length; i++) {
                 if( !sv[i] && (long)i*(long)i < sv.length ) {
                      for ( int j = i*i; j<sv.length ; j += i ) {                
                       sv[j] = true;
                      }
                 }
            }
  
       }
  
  
       static long kadensAlgo(long ar[]) {
  
            int n = ar.length;
  
            long pre = ar[0];
            long ans = ar[0];                
  
            for(int i = 1; i<n; i++) {
                 pre = Math.max(pre + ar[i], ar[i]);
                 ans = Math.max(pre, ans);
            }
            return ans;
       }
  
  
       static long  binpow( long a,   long b) {
  
            long res = 1;
            while (b > 0) {
                 if ( (b & 1) > 0){
                      res = (res * a);              
                 }
                 a = (a * a);
                 b >>= 1;
            }
  
            return res;
       }
  
       static long factorial(long n)  {
            long res = 1, i;
            for (i = 2; i <= n; i++){
                 res  =  ((res%mod) * (i%mod))%mod;
            }          
            return res;
       } 
  
       static int getCountPrime(int n) {
   
            int ans = 0;
   
            while (n%2==0) { 
                 ans ++;
                 n /= 2; 
            }  
   
            for (int i = 3; i *i<= n; i+= 2) {  
                 while (n%i == 0) {  
                      ans ++;
                      n /= i; 
                 }
            }
   
            if(n > 1 )
                 ans++;
   
            return ans; 
       }    
       static void sort(int[] arr)    {
            /* because Arrays.sort() uses quicksort which is dumb
            Collections.sort() uses merge sort */
            ArrayList<Integer> ls = new ArrayList<Integer>();
            for(int x: arr)
                 ls.add(x);          
            Collections.sort(ls);
            for(int i=0; i < arr.length; i++)
                 arr[i] = ls.get(i);
  
      }     
  
       static void sort(long[] arr)    {
            /* because Arrays.sort() uses quicksort which is dumb
            Collections.sort() uses merge sort */
            ArrayList<Long> ls = new ArrayList<Long>();
            for(Long x: arr)
                 ls.add(x);          
            Collections.sort(ls);
            for(int i=0; i < arr.length; i++)
                 arr[i] = ls.get(i);
  
      }     
    
       static int upperBound(long ar[], long k, int l, int r) {
            
           while (l <= r) {
               int m = (l + r) >> 1 ;
               if (ar[m] > k) {
                   r = m - 1 ;
               } else {
                   l = m + 1 ;
               }
           }         
           return l ;
       }
  
       static int lowerBound(long ar[], long k, int l, int r) {
           
           while (l <= r) {
               int m = (l + r) >> 1 ;
               if (ar[m] >= k) {
                   r = m - 1 ;
               } else {
                   l = m + 1 ;
               }
           }
           return l ;
       } 
  
       static void findDivisor(int n, ArrayList<Integer> al) {
  
           for(int i = 1; i*i <= n; i++){
               if( n % i == 0){
                   if(n/i==i){
                       al.add(i);
                   }
                   else{
                       al.add(n/i);
                       al.add(i);
                   }
               }
           }
  
       }
   
       static class Pair{
       
          int a;
          int f;
          Pair( int a, int f){ 
            this.a = a;
            this.f =f;
          }
      }
       
    
  
        public static void main(String[] args)  throws Exception {
    
   
            // runFile();  
  
            runIo();              
  
            int t;
            t = 1;
    
            t =  sc.nextInt();  
                  
            ans = new StringBuilder();
             
            while( t-- > 0 ) {   
                 solve();
            }                
            
            pn(ans+""); 
   
       }   
  
       public static void solve ( ) {        
                      
            int n = ni(); 
            int k = ni();
  
            int ar[] = new int[n];
  
            readArray(ar);
  
            sort(ar);
  
            int score = 0;
  
            for(int i = 0; i<n-2*k; i++)
                 score += ar[i];
  
            for(int i = n-2*k; i<n && i+k<n; i++) 
                 score += ar[i]/ar[i+k];
  
            ap(score+"\n");
  
       }
  
  
  }
   
  
  