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.math.BigInteger;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.Map;
  import java.util.PriorityQueue;
  import java.util.Set;
  import java.util.StringTokenizer;
  import java.util.stream.IntStream;
  
  public class QH {
  	static Map<Integer,Integer> map=new HashMap<>();
  	static Set<Integer> deleted=new HashSet<>();
  
  	public static void main(String[] args) {
  		FastScanner fs = new FastScanner();
  		int t=fs.nextInt();
  		int n,k;
  		
  		while(t-->0) {
  			
  			
  			n=fs.nextInt();
  			k=fs.nextInt();
  			
  			ArrayList<Integer> temp=new ArrayList<>();
  			int arr[]=new int[n];
  			
  			for(int i=0;i<n;i++) {
  				arr[i]=fs.nextInt();
  				map.put(arr[i], i);
  				temp.add(arr[i]);
  			}
  			Collections.sort(temp);
  			int count=0;
  			int index;
  			
  			for(int i=0;i<n;i++) {
  				
  				count++;
  				index=map.get(temp.get(i));
  				while(index<n&& i<n&& arr[index]==temp.get(i)) {
  					index++;
  					i++;
  				}
  				i--;
  			}
  			if(count<=k) {
  				
  				System.out.println("YES");
  			}else {
  				System.out.println("NO");
  			}
  
  				
  				
  				
  			
  			
  			
  			
  			
  			
  			
  			
  			
  		}
  
  			
  			
  
  	}
  
  	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) {
  				}
  			return st.nextToken();
  		}
  
  		BigInteger nextBigInteger() {
  			return new BigInteger(next());
  		}
  
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  
  		int[] readArray(int n) {
  			int[] arr = new int[n];
  			for (int i = 0; i < n; i++) {
  				arr[i] = nextInt();
  			}
  			return arr;
  		}
  
  		ArrayList<Integer> readList(int n) {
  			ArrayList<Integer> list = new ArrayList<>();
  			for (int i = 0; i < n; i++) {
  				list.add(nextInt());
  			}
  			return list;
  		}
  
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return str;
  		}
  
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  
  		int gcd(int a, int b) {
  			if (a == 0)
  				return b;
  			return gcd(b % a, a);
  		}
  
  		int lcm(int a, int b) {
  			return (a / gcd(a, b)) * b;
  		}
  
  		boolean[] sieveOfEratosthenes(int n) {
  
  			boolean prime[] = new boolean[n + 1];
  			Arrays.fill(prime, true);
  
  			for (int j = 2; j * j <= n; j++) {
  
  				if (prime[j] == true) {
  
  					for (int i = j * j; i <= n; i += j)
  						prime[i] = false;
  				}
  			}
  			return prime;
  		}
  
  		public int arraySum(int[] S) {
  
  			return IntStream.of(S).sum();
  		}
  	}
  
  }
  