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 q2 {
      public static void main(String[] args) throws Exception {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          long tests = Long.parseLong(br.readLine());
  
          for (long test = 1;test <= tests;test++) {
              String[] parts = br.readLine().split(" ");
              long n = Long.parseLong(parts[0]);
              long k = Long.parseLong(parts[1]);
  
              long[] arr = new long[(int)n];
  
              parts = br.readLine().split(" ");
              for(int i = 0;i < n;i++){
                  arr[i] = Long.parseLong(parts[i]);
              }
              
              long[] copy = Arrays.copyOf(arr,(int)n);
              copy = mergeSort(copy,0,(int)n-1);
  
              HashMap<Long,Integer> map = new HashMap<>();
              for(int i = 0;i < n;i++){
                  map.put(copy[i],i);
              }
  
              k--;
              for(int i = 1;i < n;i++){
                  if(map.get(arr[i - 1]) + 1 != map.get(arr[i])) k--;
                  if(k < 0) break;
              }
  
              if(k >= 0) System.out.println("YES");
              else System.out.println("No");
  
          }
      }
  
      public static long gcd(long a,long b){
          if(b == 0) return a;
          return gcd(b,a % b);
      }
      public static long[] mergeSort(long[] arr, int lo, int hi) {
          if (lo == hi) {
              long[] base = new long[1];
              base[0] = arr[lo];
              return base;
          }
          int mid = (lo + hi) / 2;
          long[] a = mergeSort(arr, lo, mid);
          long[] b = mergeSort(arr, mid + 1, hi);
          return mergeTwoSortedArrays(a, b);
      }
      public static long[] mergeTwoSortedArrays(long[] a, long[] b) {
          int i = 0, j = 0, k = 0;
          long[] ans = new long[a.length + b.length];
          while (i < a.length && j < b.length) {
              if (a[i] <= b[j]) {
                  ans[k] = a[i];
                  i++;
                  k++;
              } else {
                  ans[k] = b[j];
                  j++;
                  k++;
              }
          }
  
          while (i < a.length) {
              ans[k] = a[i];
              k++;
              i++;
          }
  
          while (j < b.length) {
              ans[k] = b[j];
              k++;
              j++;
          }
  
          return ans;
      }
  }
  