CF940A Points on the line 思维

A. Points on the line

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round.

The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, 3, 2, 1} is 2.

Diameter of multiset consisting of one point is 0.

You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?

Input

The first line contains two integers n and d (1 ≤ n ≤ 100, 0 ≤ d ≤ 100) — the amount of points and the maximum allowed diameter respectively.

The second line contains n space separated integers (1 ≤ xi ≤ 100) — the coordinates of the points.

Output

Output a single integer — the minimum number of points you have to remove.

Examples

input

Copy

3 1
2 1 4

output

1

input

Copy

3 0
7 7 7

output

0

input

Copy

6 3
1 3 4 6 9 10

output

3

Note

In the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2 - 1 = 1.

In the second test case the diameter is equal to 0, so its is unnecessary to remove any points.

In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3,4 and 6, so the diameter will be equal to 6 - 3 = 3.

 要求去除多少个数剩下的才满足条件，我们转化成求满足条件的个数，总数减去满足条件的个数就是要去除的个数。

#include<map>
#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 100010
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
int main() {
    int n,m;
    while( cin >> n >> m ) {
        int a[105];
        for( int i = 0; i < n; i ++ ) {
            cin >> a[i];
        }
        sort( a, a + n );
        int num = 0;
        for( int i = 0; i < n; i ++ ) {
            for( int j = i; j < n; j ++ ) {
                if( a[j] - a[i] <= m ) {
                    num = max( num, j - i + 1 );
                }
            }
        }
        cout << n - num << endl;
    }
    return 0;
}