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 Main {
  	
  		
  	public static void main(String[] args) throws IOException {
  		// TODO Auto-generated method stub
  		Reader.init(System.in);
  		//Reader.init();
  		PrintWriter out=new PrintWriter(System.out);
  		
  		int t=Reader.nextInt();
  		while(t>0) {
  			t--;
  			int n=Reader.nextInt(),  k=Reader.nextInt();
  			Integer[] arr=new Integer[n];
  			Integer[] arr2=new Integer[n];
  		//long s=0;
  			for(int i=0;i<n;i++) {arr[i]=Reader.nextInt();
  			arr2[i]=arr[i];
  			}
  			Arrays.sort(arr2);
  			int cur=arr[0], split=0;
  			int low=0,high=n-1;
  			int ind=0;
  			while(low<=high) {
  				int mid=(low+high)/2;
  				if(arr2[mid]== cur) {
  					ind=mid;break;
  				}
  				else if(arr2[mid]<cur) {
  					low=mid+1;
  				}
  				else high=mid-1;
  			}
  			for(int i=1;i<n;i++) {
  				ind++;
  				if(ind == n || arr2[ind]!=arr[i]) {
  					split++;
  					cur=arr[i];
  					low=0;high=n-1;
  					while(low<=high) {
  						int mid=(low+high)/2;
  						if(arr2[mid]== cur) {
  							ind=mid;break;
  						}
  						else if(arr2[mid]<cur) {
  							low=mid+1;
  						}
  						else high=mid-1;
  					}
  				}
  			}
  			if(split+1 <=k) {
  				out.println("YES");
  			}
  			else out.println("NO");
  			
  			
  			
  		}
  		
  		
  		
  		out.flush();
  		
  	}
  
  }
  
  
   
  
  
  
  
  
  
  
  
  class Reader {
      static BufferedReader reader;
      static StringTokenizer tokenizer;
      /** call this method to initialize reader for InputStream */
      static void init() throws IOException {
          reader = new BufferedReader(
                  new FileReader("C:\\Users\\samee\\Desktop\\testcase33.txt"));
          tokenizer = new StringTokenizer("");
      }
      static void init(InputStream input) {
          reader = new BufferedReader(
                  new InputStreamReader(input) );
          tokenizer = new StringTokenizer("");
      }
      /** get next word */
      static String nextLine() throws IOException{
          return reader.readLine();
      }
      static String next() throws IOException {
          while ( ! tokenizer.hasMoreTokens() ) {
              //TODO add check for eof if necessary
              tokenizer = new StringTokenizer(
                      reader.readLine() );
          }
          return tokenizer.nextToken();
      }
      static int nextInt() throws IOException {
          return Integer.parseInt( next() );
      }
      static long nextLong() throws IOException {
          return Long.parseLong( next() );
      }
      static double nextDouble() throws IOException {
          return Double.parseDouble( next() );
      }
  }