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.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.StringTokenizer;
  import java.util.TreeSet;
  
  
  public class MoamenAndKsubarrays {
  
  	public static void main(String[] args) throws IOException {
  		BufferedReader read = new BufferedReader(new InputStreamReader(System.in));//new FileReader("cowdance.in")
  		PrintWriter out = new PrintWriter(System.out);//new FileWriter("cowdance.out")
  		StringTokenizer st = new StringTokenizer(read.readLine());
  		int t = Integer.parseInt(st.nextToken());
  
  		for (int ie = 0; ie < t; ie++) {
  		st = new StringTokenizer(read.readLine());
  		int n = Integer.parseInt(st.nextToken());//Long.parseLong(st.nextToken());
  		int k = Integer.parseInt(st.nextToken());
  		int [] a = new int [n];
  		int [] arr = new int [n];
  		TreeSet<Integer> ts = new TreeSet<Integer>();
  		st = new StringTokenizer(read.readLine());
  		for (int i = 0; i < n; i++) {
  		a[i] = Integer.parseInt(st.nextToken());//Long.parseLong(st.nextToken());
  		arr[i] = a[i];
  		ts.add(a[i]);
  		}
  		Arrays.sort(arr);
  		int cnt = 0;
  		
  		for (int i = 0; i < n; i++) {
  				
  				if (i+1 < n) {
  					if (ts.higher(a[i]) != null) {
  				if (ts.higher(a[i]) != a[i+1]) {
  					cnt++;
  					}
  				
  				}else {
  					cnt++;
  				}
  				}else {
  						cnt++;
  					
  				}
  				
  				
  				
  			}
  			//out.println(cnt+" "+i+" "+inARow);
  		
  		if (cnt <= k) {
  			out.println("YES");
  		}else {
  			out.println("NO");
  		}
  
  		}
  		out.close();
  
  	}
  
  }
  