Codeforces.java

import java.util.Arrays;
import java.util.Scanner;

public class Codeforces {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();
        while (t-- > 0) {
            int n = scanner.nextInt();
            int k = scanner.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = scanner.nextInt();
            }
            Arrays.sort(a);
            int count = 1;
            int max = 1;
            for (int i = 1; i < n; i++) {
                if (a[i]-a[i-1] <= k) count++;
                else {
                    max = Math.max(max, count);
                    count = 1;
                }
            }
            max = Math.max(max, count);
            System.out.println(n-max);
        }
    }
}