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 test {
  static HashMap<Long,Integer> idx;
  public static void main(String[] args) {
  FastScanner fs=new FastScanner();
  int T=fs.nextInt();
  PrintWriter pr = new PrintWriter(System.out);
  for (int tt=0; tt<T; tt++) {
  idx =new HashMap<>();
  int n=fs.nextInt();
  int k =fs.nextInt();
  long[] ar=fs.readArrayL(n);
  long[] arrx =new long[n];
  
  for(int i=0;i<n;i++){
  arrx[i]=ar[i];
  idx.put(ar[i],i);
  }
  int cnt=0;
  arrx= sort(arrx);
  int last = idx.get(arrx[0]);
  for(int i=1;i<n;i++){
  int cut = idx.get(arrx[i]);
  // System.out.println(cut +" "+last+" "+copy[i]);
  if(cut-last!=1){
  cnt+=1;
  
  }
  last= cut;
  
  }
  if(cnt<k){
  pr.println("Yes");
  }
  else{
  pr.println("No");
  }
  
  }
  pr.close();
  }
  
  
  static void sort(int[] a) {
  ArrayList<Integer> l=new ArrayList<>();
  for (int i:a) l.add(i);
  Collections.sort(l);
  for (int i=0; i<a.length; i++) a[i]=l.get(i);
  }
  private static long[] sort(long[] e){
  ArrayList<Long> x=new ArrayList<>();
  for(long c:e){
  x.add(c);
  }
  Collections.sort(x);
  long[] y = new long[e.length];
  for(int i=0;i<x.size();i++){
  y[i]=x.get(i);
  }
  return y;
  }
  
  static class FastScanner {
  BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  StringTokenizer st=new StringTokenizer("");
  String next() {
  while (!st.hasMoreTokens())
  try {
  st=new StringTokenizer(br.readLine());
  } catch (IOException e) {
  e.printStackTrace();
  }
  return st.nextToken();
  }
  
  int nextInt() {
  return Integer.parseInt(next());
  }
  int[] readArray(int n) {
  int[] a=new int[n];
  for (int i=0; i<n; i++) a[i]=nextInt();
  return a;
  }
  long[] readArrayL(int n) {
  long[] a=new long[n];
  for (int i=0; i<n; i++) a[i]=nextLong();
  return a;
  }
  long nextLong() {
  return Long.parseLong(next());
  }
  }
  
  
  }