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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.*;
  
  public class B {
      public static void main(String[] args) throws IOException {
          int t = sc.nextInt();
  
          for (int i = 0; i < t; i++) {
  
              int n = sc.nextInt();
              int k = sc.nextInt();
  
              int[] arr = new int[n];
              int[] arr1 = new int[n];
              int[] arr2  = new int[n];
  
              HashMap<Integer,Integer> hm = new HashMap<>();
  
              for (int j = 0; j < n; j++) {
                  arr[j]  = sc.nextInt();
                  arr1[j] = arr[j];
                  hm.put(arr[j] , -1);
              }
  
              if(k == n){
                  System.out.println("YES");
                  continue;
              }
  
              Arrays.sort(arr1);
  
              for (int j = 0; j < n; j++) {
                  hm.replace(arr1[j] , j);
              }
  
              for (int j = 0; j < n; j++) {
                  arr2[j] = hm.get(arr[j]);
  //                System.out.print(arr2[j] + " ");
              }
  //            System.out.println();
  
              int idx = 1;
              int count = 1;
              while(idx != n){
                  if(arr2[idx]  == arr2[idx-1] + 1){
                      idx++;
                      continue;
                  }
                  count++;
                  idx++;
              }
  
  //            System.out.println(count);
  
              if(k >= count){
                  System.out.println("Yes");
              }
              else{
                  System.out.println("No");
              }
  
          }
  
      }
  
      private static class sc {
          static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
          static StringTokenizer tokenizer = new StringTokenizer("");
  
          static String next() throws IOException {
              while (!tokenizer.hasMoreTokens())
                  tokenizer = new StringTokenizer(reader.readLine());
              return tokenizer.nextToken();
          }
  
          static int nextInt() throws IOException {
              return Integer.parseInt(next());
          }
  
          static double nextDouble() throws IOException {
              return Double.parseDouble(next());
          }
  
          static long nextLong() throws IOException {
              return Long.parseLong(next());
          }
      }
  }
  