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.util.*;
  import java.lang.*;
  import java.io.*;
  
  public class Main
  {
      static long mod = (int)1e9+7;
      // static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
  	public static void main (String[] args) throws java.lang.Exception
  	{
  		FastReader sc =new FastReader();
  		
  	    int t=sc.nextInt();
  	    
  	   // int t=1;
  	    
  	    while(t-->0)
  	    {
  	        int n = sc.nextInt();
  	        int k = sc.nextInt();
  	        int arr[] = sc.readArray(n);
  	        reverse_sorted(arr);
  	        long sum = 0;
  	        for(int i=0;i<k;i++)
  	        {
  	            sum += (arr[i + k]/arr[i]);
  	        }
  	        for(int i=2*k;i<n;i++)
  	        {
  	            sum += arr[i];
  	        }
  	        System.out.println(sum);
  	    }
  	    
  	}
  	
  	
  	
  	
  	static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() { return Integer.parseInt(next()); }
   
          long nextLong() { return Long.parseLong(next()); }
   
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
          
          float nextFloat()
          {
              return Float.parseFloat(next());
          }
   
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
          
          int[] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		
  		long[] readArrayLong(int n) {
  			long[] a=new long[n];
  			for (int i=0; i<n; i++) a[i]=nextLong();
  			return a;
  		}
  		
      }
      
      
      
      public static int[] radixSort2(int[] a)
  	{
  		int n = a.length;
  		int[] c0 = new int[0x101];
  		int[] c1 = new int[0x101];
  		int[] c2 = new int[0x101];
  		int[] c3 = new int[0x101];
  		for(int v : a) {
  			c0[(v&0xff)+1]++;
  			c1[(v>>>8&0xff)+1]++;
  			c2[(v>>>16&0xff)+1]++;
  			c3[(v>>>24^0x80)+1]++;
  		}
  		for(int i = 0;i < 0xff;i++) {
  			c0[i+1] += c0[i];
  			c1[i+1] += c1[i];
  			c2[i+1] += c2[i];
  			c3[i+1] += c3[i];
  		}
  		int[] t = new int[n];
  		for(int v : a)t[c0[v&0xff]++] = v;
  		for(int v : t)a[c1[v>>>8&0xff]++] = v;
  		for(int v : a)t[c2[v>>>16&0xff]++] = v;
  		for(int v : t)a[c3[v>>>24^0x80]++] = v;
  		return a;
  	}
  	
  	static void reverse_sorted(int[] arr)
  	{
  	    ArrayList<Integer> list = new ArrayList<>();
  	    for(int i=0;i<arr.length;i++)
  	    {
  	        list.add(arr[i]);
  	    }
  	    Collections.sort(list , Collections.reverseOrder());
  	    for(int i=0;i<arr.length;i++)
  	    {
  	        arr[i] = list.get(i);
  	    }
  	}
  	
  	static int LowerBound(int a[], int x) { // x is the target value or key
          int l=-1,r=a.length;
          while(l+1<r) {
              int m=(l+r)>>>1;
              if(a[m]>=x) r=m;
              else l=m;
          }
          return r;
      }
      
      static int UpperBound(ArrayList<Integer> list, int x) {// x is the key or target value
          int l=-1,r=list.size();
          while(l+1<r) {
              int m=(l+r)>>>1;
              if(list.get(m)<=x) l=m;
              else r=m;
          }
          return l+1;
      }
      
      public static HashMap<Integer, Integer> sortByValue(HashMap<Integer, Integer> hm)
      {
          // Create a list from elements of HashMap
          List<Map.Entry<Integer, Integer> > list =
                 new LinkedList<Map.Entry<Integer, Integer> >(hm.entrySet());
   
          // Sort the list
          Collections.sort(list, new Comparator<Map.Entry<Integer, Integer> >() {
              public int compare(Map.Entry<Integer, Integer> o1,
                                 Map.Entry<Integer, Integer> o2)
              {
                  return (o1.getValue()).compareTo(o2.getValue());
              }
          });
           
          // put data from sorted list to hashmap
          HashMap<Integer, Integer> temp = new LinkedHashMap<Integer, Integer>();
          for (Map.Entry<Integer, Integer> aa : list) {
              temp.put(aa.getKey(), aa.getValue());
          }
          return temp;
      }
      
      static class Queue_Pair implements Comparable<Queue_Pair> {
  		int first , second;
  		public Queue_Pair(int first, int second) {
  			this.first=first;
  			this.second=second;
  		}
  		public int compareTo(Queue_Pair o) {
  			return Integer.compare(o.first, first);
  		}
  	}
      
      static void leftRotate(int arr[], int d, int n)
      {
          for (int i = 0; i < d; i++)
              leftRotatebyOne(arr, n);
      }
   
      static void leftRotatebyOne(int arr[], int n)
      {
          int i, temp;
          temp = arr[0];
          for (i = 0; i < n - 1; i++)
              arr[i] = arr[i + 1];
          arr[n-1] = temp;
          
      }
      
      static boolean isPalindrome(String str)
      {
   
          // Pointers pointing to the beginning
          // and the end of the string
          int i = 0, j = str.length() - 1;
   
          // While there are characters to compare
          while (i < j) {
   
              // If there is a mismatch
              if (str.charAt(i) != str.charAt(j))
                  return false;
   
              // Increment first pointer and
              // decrement the other
              i++;
              j--;
          }
   
          // Given string is a palindrome
          return true;
      }
      
      static boolean palindrome_array(char arr[], int n)
      {
          // Initialise flag to zero.
          int flag = 0;
   
          // Loop till array size n/2.
          for (int i = 0; i <= n / 2 && n != 0; i++) {
   
              // Check if first and last element are different
              // Then set flag to 1.
              if (arr[i] != arr[n - i - 1]) {
                  flag = 1;
                  break;
              }
          }
   
          // If flag is set then print Not Palindrome
          // else print Palindrome.
          if (flag == 1)
              return false;
          else
              return true;
      }
      
  	static boolean allElementsEqual(int[] arr,int n)
  	{
  	    int z=0;
  	        for(int i=0;i<n-1;i++)
  		    {
  		        if(arr[i]==arr[i+1])
  		        {
  		            z++;
  		        }
  		    }
  		    if(z==n-1)
  		    {
  		        return true;
  		    }
  		    else
  		    {
  		        return false;
  		    }
  		    
  	}
  	
  	static boolean allElementsDistinct(int[] arr,int n)
  	{
  	    int z=0;
  	        for(int i=0;i<n-1;i++)
  		    {
  		        if(arr[i]!=arr[i+1])
  		        {
  		            z++;
  		        }
  		    }
  		    if(z==n-1)
  		    {
  		        return true;
  		    }
  		    else
  		    {
  		        return false;
  		    }
  		    
  		    
  	}
  	
  	public static void reverse(int[] array)
      {
    
          // Length of the array
          int n = array.length;
    
          // Swaping the first half elements with last half
          // elements
          for (int i = 0; i < n / 2; i++) {
    
              // Storing the first half elements temporarily
              int temp = array[i];
    
              // Assigning the first half to the last half
              array[i] = array[n - i - 1];
    
              // Assigning the last half to the first half
              array[n - i - 1] = temp;
          }
      }
      
      public static void reverse_Long(long[] array)
      {
    
          // Length of the array
          int n = array.length;
    
          // Swaping the first half elements with last half
          // elements
          for (int i = 0; i < n / 2; i++) {
    
              // Storing the first half elements temporarily
              long temp = array[i];
    
              // Assigning the first half to the last half
              array[i] = array[n - i - 1];
    
              // Assigning the last half to the first half
              array[n - i - 1] = temp;
          }
      }
  	
  	static boolean isSorted(int[] a)
      {
          for (int i = 0; i < a.length - 1; i++)
          {
              if (a[i] > a[i + 1]) {
                  return false;
              }
          }
   
          return true;
      }
      
      
      
      static boolean isReverseSorted(int[] a)
      {
          for (int i = 0; i < a.length - 1; i++)
          {
              if (a[i] < a[i + 1]) {
                  return false;
              }
          }
   
          return true;
      }
      
      static int[] rearrangeEvenAndOdd(int arr[], int n)
      {
          ArrayList<Integer> list = new ArrayList<>();
  		    
  		    for(int i=0;i<n;i++)
  		    {
  		        if(arr[i]%2==0)
  		        {
  		            list.add(arr[i]);
  		        }
  		    }
  		    
  		    for(int i=0;i<n;i++)
  		    {
  		        if(arr[i]%2!=0)
  		        {
  		            list.add(arr[i]);
  		        }
  		    }
  		    int len = list.size();
  		    int[] array = list.stream().mapToInt(i->i).toArray();
  		    return array;
      }
      
      static long[] rearrangeEvenAndOddLong(long arr[], int n)
      {
          ArrayList<Long> list = new ArrayList<>();
  		    
  		    for(int i=0;i<n;i++)
  		    {
  		        if(arr[i]%2==0)
  		        {
  		            list.add(arr[i]);
  		        }
  		    }
  		    
  		    for(int i=0;i<n;i++)
  		    {
  		        if(arr[i]%2!=0)
  		        {
  		            list.add(arr[i]);
  		        }
  		    }
  		    int len = list.size();
  		    long[] array = list.stream().mapToLong(i->i).toArray();
  		    return array;
      }
  	
  	
      
      static boolean isPrime(long n)
      {
   
          // Check if number is less than
          // equal to 1
          if (n <= 1)
              return false;
   
          // Check if number is 2
          else if (n == 2)
              return true;
   
          // Check if n is a multiple of 2
          else if (n % 2 == 0)
              return false;
   
          // If not, then just check the odds
          for (long i = 3; i <= Math.sqrt(n); i += 2)
          {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
      
      static long getSum(long n)
      {    
          long sum = 0;
            
          while (n != 0)
          {
              sum = sum + n % 10;
              n = n/10;
          }
        
      return sum;
      }
      
      static int gcd(int a, int b)
      {
        if (b == 0)
          return a;
        return gcd(b, a % b);
      }
       
      static long gcdLong(long a, long b)
      {
          if (b == 0)
          return a;
        return gcdLong(b, a % b);
      }
      
      static void swap(int i, int j)
      {
          int temp = i;
          i = j;
          j = temp;
      }
  	
  	static int countDigit(int n)
      {
          return (int)Math.floor(Math.log10(n) + 1);
      }
  	
  }
  
  class Pair
  {
      int first;
      int second;
      Pair(int first , int second)
      {
          this.first = first;
          this.second = second;
      }
  }
  