description: Moamen has an array of n distinct integers. He wants to sort that array in non-decreasing order by doing the following operations in order exactly once:
  
    1. Split the array into exactly k non-empty subarrays such that each element belongs to exactly one subarray. 
    2. Reorder these subarrays arbitrary. 
    3. Merge the subarrays in their new order. 
  
  
  
  A sequence a is a subarray of a sequence b if a can be obtained from b by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end.
  
  Can you tell Moamen if there is a way to sort the array in non-decreasing order using the operations written above?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^3) — the number of test cases. The description of the test cases follows.
  
  The first line of each test case contains two integers n and k (1 ≤ k ≤ n ≤ 10^5).
  
  The second line contains n integers a_1, a_2, …, a_n (0 ≤ |a_i| ≤ 10^9). It is guaranteed that all numbers are distinct.
  
  It is guaranteed that the sum of n over all test cases does not exceed 3⋅10^5.
  
  Output
  
  For each test case, you should output a single string.
  
  If Moamen can sort the array in non-decreasing order, output "YES" (without quotes). Otherwise, output "NO" (without quotes).
  
  You can print each letter of "YES" and "NO" in any case (upper or lower).
  
  Example
  
  Input
  
  
  3
  5 4
  6 3 4 2 1
  4 2
  1 -4 0 -2
  5 1
  1 2 3 4 5
  
  
  Output
  
  
  Yes
  No
  Yes
  
  Note
  
  In the first test case, a = [6, 3, 4, 2, 1], and k = 4, so we can do the operations as follows: 
  
    1. Split a into \{ [6], [3, 4], [2], [1] \}. 
    2. Reorder them: \{ [1], [2], [3,4], [6] \}. 
    3. Merge them: [1, 2, 3, 4, 6], so now the array is sorted. 
  
  
  
  In the second test case, there is no way to sort the array by splitting it into only 2 subarrays.
  
  As an example, if we split it into \{ [1, -4], [0, -2] \}, we can reorder them into \{ [1, -4], [0, -2] \} or \{ [0, -2], [1, -4] \}. However, after merging the subarrays, it is impossible to get a sorted array.
solution: import java.io.*;
  import java.util.*;
  
  public class C {
  
      public static class Line {
          LinkedList<Integer> arr;
  
          Line(LinkedList<Integer> a) {
              arr = a;
          }
  
          @Override
          public String toString() {
              return "Line{" +
                      "arr=" + arr +
                      '}';
          }
      }
  
      public static class SortLine implements Comparator<Line> {
  
          public int compare(Line a, Line b) {
  
              return a.arr.get(0) - b.arr.get(0);
  
          }
  
      }
  
      public static void main(String[] args) {
          FastScanner in = new FastScanner(System.in);
          int t = in.nextInt();
          for (int u = 0; u < t; u++) {
              int n = in.nextInt();
              int k = in.nextInt();
              int[] a = in.nextIntArray(n);
              int count = 1;
              LinkedList<Integer> list = new LinkedList<>();
              ArrayList<Line> lines = new ArrayList<>();
              for (int i = 0; i < n - 1; i++) {
                  if (a[i] > a[i + 1]) {
                      count++;
                      list.add(a[i]);
                      lines.add(new Line(list));
                      list = new LinkedList<>();
                      if (i == n - 2) {
                          list.add(a[i + 1]);
                          lines.add(new Line(list));
                      }
                  } else {
                      if (i == n - 2) {
                          list.add(a[i]);
                          list.add(a[i + 1]);
                          lines.add(new Line(list));
                      } else {
                          list.add(a[i]);
                      }
                  }
              }
              if (n == 1) {
                  list.add(a[0]);
                  lines.add(new Line(list));
              }
              Collections.sort(lines, new SortLine());
              HashMap<Integer, Line> map = new HashMap<>();
              for (Line line : lines) {
                  map.put(line.arr.getFirst(), line);
              }
              if (count > k) {
                  System.out.println("No");
              } else {
                  Arrays.sort(a);
                  count = 0;
                  for (int i = 0; i < n; i++) {
                      //System.out.println(map);
                      int f = a[i];
                      Line line = map.get(f);
                      while (line.arr.size() > 0 && i < n && line.arr.getFirst() == a[i]) {
                          i++;
                          line.arr.removeFirst();
                      }
                      count++;
                      i--;
                      if (line.arr.size() > 0) {
                          map.put(line.arr.getFirst(), line);
                      }
                      map.remove(f);
                  }
                  if (count > k) {
                      System.out.println("No");
                  } else {
                      System.out.println("Yes");
                  }
              }
          }
      }
  
      static class FastScanner {
          public BufferedReader br;
          public StringTokenizer st;
  
          public FastScanner(InputStream in) {
              br = new BufferedReader(new InputStreamReader(in));
          }
  
          public FastScanner(String fileName) {
              try {
                  br = new BufferedReader(new FileReader(fileName));
              } catch (FileNotFoundException e) {
                  e.printStackTrace();
              }
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public String next() {
              while (st == null || !st.hasMoreElements()) {
                  String line = null;
                  try {
                      line = br.readLine();
                  } catch (IOException e) {
                  }
                  st = new StringTokenizer(line);
              }
              return st.nextToken();
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          public double nextDouble() {
              return Double.parseDouble(next());
          }
  
          public int[] nextIntArray(int n) {
              int[] ret = new int[n];
              for (int i = 0; i < n; i++) {
                  ret[i] = nextInt();
              }
              return ret;
          }
  
      }
  }