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.util.*;
  import java.io.*;
  
  public class Solution {
  
      public static void main(String[] args) throws IOException {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  
          int t = Integer.parseInt(br.readLine());
  
          BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
  
          StringTokenizer st;
  
          while (t-- > 0) {
  
              // int n = Integer.parseInt(br.readLine());
              
              st = new StringTokenizer(br.readLine());
              int n = Integer.parseInt(st.nextToken());
              int k = Integer.parseInt(st.nextToken());
              st = new StringTokenizer(br.readLine());
  
              int arr[] = new int[n];
              int arr2[] = new int[n];
              HashMap<Integer, Integer> map = new HashMap<>();
              for(int i = 0; i < n; i++)
              {
              int e = Integer.parseInt(st.nextToken());
              arr[i] = e;
              arr2[i] = e;
              }
  
              Arrays.sort(arr2);
  
              for(int i = 0; i < n - 1; i++)
              {
                  map.put(arr2[i], arr2[i+1]);
              }
  
              map.put(arr2[n-1], arr2[n-1]);
  
              int numSeg = 0;
              // int last = -1;
              for(int i = 0; i < n-1; i++)
              {   
                  int e1 = arr[i];
                  int e2 = arr[i+1];
                  
                  if(map.get(e1) == e2)
                      continue;
  
                  else
                  numSeg++;
              }
  
              ++numSeg;
              // output.write("numseg = " + numSeg + '\n');
              if(numSeg<=k)
              output.write("YES\n");
              else
              output.write("NO\n");
  
  
              // char arr[] = br.readLine().toCharArray();
  
              // output.write();
              // int n = Integer.parseInt(st.nextToken());
  
              // HashMap<Character, Integer> map = new HashMap<Character, Integer>();
  
              // if
              
  
              // long a = Long.parseLong(st.nextToken());
              // long b = Long.parseLong(st.nextToken());
  
              // if(flag == 1)
              // output.write("NO\n");
              // else
              // output.write("YES\n" + x + " " + y + " " + z + "\n");
  
              // output.write(n+ "\n");
  
          }
  
          output.flush();
  
      }
  
  }