A. Points on the line

A. Points on the line
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
inputCopy
3 1
2 1 4
output
1
inputCopy
3 0
7 7 7
output
0
inputCopy
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 <bits/stdc++.h>

using namespace std;

int a[20000];

int main()
{

    int m,n;
    int p,q;
    cin>>m>>n;
    for(int i=1;i<=m;i++)
        cin>>a[i];
    sort(a+1,a+m+1);
    int i,j,ans=0;
    for( i=1;i<=m;i++)
    {
       for(j=m;j>=i;j--)
        {

           if(a[j]-a[i]<=n)
            {
                ans=max(ans,j-i+1);
            }
        }
    }
    cout<<m-ans;

    return 0;
}