A11594 | Points on the line

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$ ?

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<=x_{i}<=100$ ) — the coordinates of the points.

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