Minimum Removals Problem Statement

Given an integer array ARR of size N and an integer K, determine the minimum number of elements that need to be removed so that the difference between the maximum and minimum elements of the remaining array is less than or equal to K.

Example:

Input:

N = 4
ARR = [5, 10, 2]
K = 3

Output:

1

Explanation:

The initial difference is 10 - 2 = 8, which is greater than K (3). By removing 10, the difference becomes 5 - 2 = 3, which is ≤ K.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 5000
• 0 ≤ K ≤ 105
• -105 ≤ ARR[i] ≤ 105
• Time Limit: 1 second

Input Format:

The first line contains an integer T - the number of test cases.
For each test case, the first line has two integers, N and K.
The second line contains N space-separated integers, the elements of ARR.

Output Format:

For each test case, print the minimum number of elements to remove to achieve the condition. Output results on separate lines for each test case.