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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintStream;
  import java.io.File;
  import java.io.FileInputStream;
  import java.util.*;
  
  public class Main {
  
      // static final File ip = new File("input.txt");
      // static final File op = new File("output.txt");
      // static {
      // try {
      // System.setOut(new PrintStream(op));
      // System.setIn(new FileInputStream(ip));
      // } catch (Exception e) {
      // }
      // }
  
      public static void main(String[] args) {
          FastReader sc = new FastReader();
          int test = sc.nextInt();
          while (test-- > 0) {
              int n = sc.nextInt();
              int k = sc.nextInt();
              int[] a = new int[n];
              for (int i = 0; i < n; i++)
                  a[i] = sc.nextInt();
              sortI(a);
              reverse(a);
              long ans = 0;
              for (int i = 0; i < k; i++) {
                  ans += a[i + k] / a[i];
              }
              for (int i = 2 * k; i < n; i++) {
                  ans += a[i];
              }
              System.out.println(ans);
          }
      }
  
      static long power(long x, long y, long p) {
          long res = 1;
          x = x % p;
          if (x == 0)
              return 0;
          while (y > 0) {
              if ((y & 1) != 0)
                  res = (res * x) % p;
              y = y >> 1;
              x = (x * x) % p;
          }
          return res;
      }
  
      public static int countSetBits(long number) {
          int count = 0;
          while (number > 0) {
              ++count;
              number &= number - 1;
          }
          return count;
      }
  
      static int lower_bound(long target, long[] a, int pos) {
          if (pos >= a.length)
              return -1;
          int low = pos, high = a.length - 1;
          while (low < high) {
              int mid = low + (high - low) / 2;
              if (a[mid] < target)
                  low = mid + 1;
              else
                  high = mid;
          }
          return a[low] >= target ? low : -1;
      }
  
      private static <T> void swap(int[] a, int i, int j) {
          int tmp = a[i];
          a[i] = a[j];
          a[j] = tmp;
      }
  
      static class pair {
          int a;
          int b;
  
          pair(int x, int y) {
              this.a = x;
              this.b = y;
          }
      }
  
      static class first implements Comparator<pair> {
  
          public int compare(pair p1, pair p2) {
              if (p1.a > p2.a)
                  return 1;
              else if (p1.a < p2.a)
                  return -1;
              return 0;
          }
      }
  
      static class second implements Comparator<pair> {
  
          public int compare(pair p1, pair p2) {
              if (p1.b > p2.b)
                  return 1;
              else if (p1.b < p2.b)
                  return -1;
              return 0;
          }
      }
  
      private static long getSum(int[] array) {
          long sum = 0;
          for (int value : array) {
              sum += value;
          }
          return sum;
      }
  
      private static boolean isPrime(Long x) {
          if (x < 2)
              return false;
          for (long d = 2; d * d <= x; ++d) {
              if (x % d == 0)
                  return false;
          }
          return true;
      }
  
      static int[] reverse(int a[]) {
          int n = a.length;
          int i, k;
          int t;
          for (i = 0; i < n / 2; i++) {
              t = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = t;
          }
          return a;
      }
  
      private static boolean isPrimeInt(int x) {
          if (x < 2)
              return false;
          for (int d = 2; d * d <= x; ++d) {
              if (x % d == 0)
                  return false;
          }
          return true;
      }
  
      public static String reverse(String input) {
          StringBuilder str = new StringBuilder("");
  
          for (int i = input.length() - 1; i >= 0; i--) {
              str.append(input.charAt(i));
          }
  
          return str.toString();
      }
  
      private static int[] getPrimes(int n) {
          boolean[] used = new boolean[n + 1];
          used[0] = used[1] = true;
          // int size = 0;
          for (int i = 2; i <= n; ++i) {
              if (!used[i]) {
                  // ++size;
                  for (int j = 2 * i; j <= n; j += i) {
                      used[j] = true;
                  }
              }
          }
          int[] primes = new int[n + 1];
          for (int i = 0; i <= n; ++i) {
              if (!used[i]) {
                  primes[i] = 1;
              }
          }
          return primes;
      }
  
      private static long lcm(long a, long b) {
          return a / gcd(a, b) * b;
      }
  
      private static long gcd(long a, long b) {
          return (a == 0 ? b : gcd(b % a, a));
      }
  
      static void sortI(int[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              int tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      static void shuffleList(ArrayList<Long> arr) {
          int n = arr.size();
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              long tmp = arr.get(i);
              int randomPos = i + rnd.nextInt(n - i);
              arr.set(i, arr.get(randomPos));
              arr.set(randomPos, tmp);
          }
      }
  
      static void factorize(long n) {
          int count = 0;
          while (!(n % 2 > 0)) {
              n >>= 1;
  
              count++;
          }
          if (count > 0) {
              // System.out.println("2" + " " + count);
          }
          long i = 0;
          for (i = 3; i <= (long) Math.sqrt(n); i += 2) {
              count = 0;
              while (n % i == 0) {
                  count++;
                  n = n / i;
              }
              if (count > 0) {
                  // System.out.println(i + " " + count);
              }
          }
  
          if (n > 2) {
              // System.out.println(i + " " + count);
          }
      }
  
      static void sortL(long[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              long tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      ////////////////////////////////// DSU START ///////////////////////////
  
      static class DSU {
          int[] parent, rank, total_Elements;
  
          DSU(int n) {
              parent = new int[n + 1];
              rank = new int[n + 1];
              total_Elements = new int[n + 1];
              for (int i = 0; i <= n; i++) {
                  parent[i] = i;
                  rank[i] = 1;
                  total_Elements[i] = 1;
              }
          }
  
          int find(int u) {
              if (parent[u] == u)
                  return u;
              return parent[u] = find(parent[u]);
          }
  
          void unionByRank(int u, int v) {
              int pu = find(u);
              int pv = find(v);
  
              if (pu != pv) {
                  if (rank[pu] > rank[pv]) {
                      parent[pv] = pu;
                      total_Elements[pu] += total_Elements[pv];
                  } else if (rank[pu] < rank[pv]) {
                      parent[pu] = pv;
                      total_Elements[pv] += total_Elements[pu];
                  } else {
                      parent[pu] = pv;
                      total_Elements[pv] += total_Elements[pu];
                      rank[pv]++;
                  }
              }
          }
  
          boolean unionBySize(int u, int v) {
              u = find(u);
              v = find(v);
              if (u != v) {
                  parent[u] = v;
                  total_Elements[v] += total_Elements[u];
                  total_Elements[u] = 0;
                  return true;
              }
              return false;
          }
      }
  
      ////////////////////////////////// DSU END /////////////////////////////
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public boolean hasNext() {
              return false;
          }
  
          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());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  }