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.util.function.Function;
  import java.util.stream.Collectors;
  
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.*;
  import java.math.*;
  
  
  
  
  public class Cp
  {
  	static StringBuilder sb;
  	static dsu dsu;
  	static long fact[];
  	static long mod=(long)(1e9+7);
  	static ArrayList<Integer>prime;
  	//static int x[];
  	static long A[],dp[];
  	static int n;
  	static ArrayList<Integer>adj[];
  	static ArrayList<Integer>l;
  	static boolean visited[];
  	
  	static void solve()
      {
  	int n=i();
  	int k=i();
  	int A[]=new int[n];
  	
  	ArrayList<Integer>l=new ArrayList<>();
  	
  			for(int i=0;i<n;i++)
  	{
  		A[i]=i();
  		l.add(A[i]);
  	}
  			Collections.sort(l,Collections.reverseOrder());
  			//System.out.println(l);
  			int i=0;
  			int j=k;
  			int ans=0;
  			while(i<k)
  			{
  				ans+=l.get(j)/l.get(i);
  				i++;j++;
  			}
  			for(int ii=2*k;ii<l.size();ii++)
  				ans+=l.get(ii);
  			
  			System.out.println(ans);
  	
  	
  
  	
  	
  	
  
  	//System.out.println(ans);
  		
      }
  	public static void main(String[] args)
  	{
  		 sb=new StringBuilder();
  	     int test=i();
  	    for(int tt=1;tt<=test;tt++) 
  	    {
  	         solve();
  	    }
  	    System.out.println(sb);
  	}
  //*******************************************NCR%P*******************************************************	 
  	 static long ncr(int n, int r)
  	 {
  		 if(r>n)
  			 return (long)0;
  		 
  		 long res=fact[n]%mod;
  		 //System.out.println(res);
  		 res=((long)(res%mod)*(long)(p(fact[r],mod-2)%mod))%mod;
  		 res=((long)(res%mod)*(long)(p(fact[n-r],mod-2)%mod))%mod;
  		 //System.out.println(res);
  		 return res;
  		
  		 
  	 }
  		static long p(long x, long y)//POWER FXN //
  		{
  			if(y==0)
  				return 1;
  			
  			long res=1;
  			while(y>0)
  			{
  				if(y%2==1)
  				{
  					res=(res*x)%mod;
  					y--;
  				}
  				
  				x=(x*x)%mod;
  				y=y/2;
  				
  				
  			}
  			return res;
  		}
  		static long ceil(long num, long den)
  		{
  			return (long)(num+den-1)/den;
  		}
  		
  
  //*******************************************END*******************************************************
  		static int LowerBound(long a[], long x, int i, int j) 
  		{ 
  			//X is the key value
  			int l=i;int r=j;
  			int lb=-1;
  			  while(l<=r)
  			  {
  			    int m=(l+r)/2;
  			    
  			    if(a[m]>=x) 
  			    {
  			    	lb=m;
  			    	r=m-1;
  			    }
  			    else l=m+1;
  			  }
  			  return lb;
  		}
  		static int UpperBound(long a[], long x, int i, int j) 
  		{// x is the key or target value
  		    int l=i,r=j;
  		    int ans=-1;
  		    while(l<=r)
  		    {
  		       int m=(l+r)/2;
  		       
  		       if(a[m]<=x) 
  		       {
  		    	   ans=m;
  		    	   l=m+1;
  		       }
  		       else r=m-1;
  		    }
  		    return ans;
  		 }
  		
  		
  		
  	 
  	 
  	 //*********************************Disjoint set union*************************//
  	 static class dsu
  	 {
  		 int parent[];
  		 dsu(int n)
  		 {
  			 parent=new int[n+1];
  			 for(int i=0;i<=n;i++)
  				 parent[i]=-1;
  		 }
  		 int find(int a)
  		 {
  			 if(parent[a]<0)
  				 return a;
  			 else
  			 {
  				 int x=find(parent[a]);
  				 parent[a]=x;
  				 return x;
  			 }
  		 }
  		 void merge(int a,int b)
  		 {
  			 a=find(a);
  			 b=find(b);
  			 if(a==b)
  				 return;
  			 parent[b]=a;
  		 }
  	 }
  	 
  	 
  	 
  //*******************************************PRIME FACTORIZE *****************************************************************************************************//
  	 static TreeMap<Integer,Integer> prime(long n)
  	 {
  		 TreeMap<Integer,Integer>h=new TreeMap<>();
  		 long num=n;
  		 for(int i=2;i<=Math.sqrt(num);i++)
  		 {
  			 if(n%i==0)
  			 {
  				 int nt=0;
  				 while(n%i==0) {
  					 n=n/i;
  					 nt++;
  				 }
  				 h.put(i, nt);
  			 }
  		 }
  		 if(n!=1)
  			 h.put((int)n, 1);
  		 return h;
  		 
  	 }
  	 
  	
  	
  //*************CLASS PAIR ***********************************************************************************************************************************************
  	   
  	 
  	 static class pair implements Comparable<pair>
  	    {
  	        int x;
  	        int y;
  	       
  	        pair(int x, int y) {
  	            this.x = x;
  	            this.y = y;
  	          
  	        }
  	        public int compareTo(pair o)
  	        {
  	        	return(int) (y-o.y);
  	        	
  	        }
  	        public int hashCode() 
  	        { 
  	                final int temp = 14; 
  	                int ans = 1; 
  	                ans =x*31+y*13; 
  	                return (int)ans;
  	        }
  	        @Override
  	         public boolean equals(Object o) 
  	         { 
  	             if (this == o) { 
  	                 return true; 
  	             } 
  	             if (o == null) { 
  	                 return false; 
  	             } 
  	             if (this.getClass() != o.getClass()) { 
  	                 return false; 
  	             } 
  	             pair other = (pair)o; 
  	             if (this.x != other.x || this.y!=other.y) { 
  	                 return false; 
  	             } 
  	             return true; 
  	         }
  	    } 
  	        
  	        
  			
  //*************CLASS PAIR *****************************************************************************************************************************************************
  	
  	
  	
  
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
  
          public int Int() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public String String() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public String next() {
              return String();
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  
      static class OutputWriter {
          private final PrintWriter writer;
  
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
  
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
  
          public void print(Object... objects) {
              for (int i = 0; i < objects.length; i++) {
                  if (i != 0)
                      writer.print(' ');
                  writer.print(objects[i]);
              }
          }
  
          public void printLine(Object... objects) {
              print(objects);
              writer.println();
          }
  
          public void close() {
              writer.close();
          }
  
          public void flush() {
              writer.flush();
          }
      }
  
      static InputReader in = new InputReader(System.in);
      static OutputWriter out = new OutputWriter(System.out);
     
  
      public static int[] sort(int[] a) {
          int n = a.length;
          ArrayList<Integer> l = new ArrayList<>();
          for (int i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
          return a;
      }
      public static long[] sort(long[] a) {
          int n = a.length;
          ArrayList<Long> l = new ArrayList<>();
          for (long i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
          return a;
      }
  
      public static long pow(long x, long y) {
          long res = 1;
          while (y > 0) {
              if (y % 2 != 0) {
                  res = (res * x);// % modulus;
                  y--;
  
              }
              x = (x * x);// % modulus;
              y = y / 2;
          }
          return res;
      }
  //GCD___+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
      public static long gcd(long x, long y) {
          if (x == 0)
              return y%mod;
          else
              return gcd(y % x, x);
      }
      //****************LOWEST COMMON MULTIPLE   *************************************************************************************************************************************
  
      public static long lcm(long x, long y) {
          return (x * (y / gcd(x, y)));
      }
  //INPUT PATTERN******************************************************************************************************************************************************************
      public static int i() {
          return in.Int();
      }
  
      public static long l() {
          String s = in.String();
          return Long.parseLong(s);
      }
  
      public static String s() {
          return in.String();
      }
  
      public static int[] readArray(int n) {
          int A[] = new int[n];
          for (int i = 0; i < n; i++) {
              A[i] = i();
          }
          return A;
      }
  
      public static long[] readArray(long n) {
          long A[] = new long[(int) n];
          for (int i = 0; i < n; i++) {
              A[i] = l();
          }
          return A;
      }
      public int[][] deepCopy(int[][] matrix) {
  		return java.util.Arrays.stream(matrix).map(el -> el.clone()).toArray($ -> matrix.clone());
  		}
   
  
  }
  
  
  
  
  
  
  	