940A - Points on the line - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define li long long int
#define ppb pop_back
#define ct cout 
#define el "\n"
#define ff first
#define ss second
#define sg string
#define vec vector<li>
#define vep vector<pair<li,li>>
#define mep map<li,li>
#define ves vector<string>
#define isort(n) sort(n.begin(), n.end())
#define dsort(n) sort(n.begin(), n.end(), greater<int>());
#define all(n) n.begin(), n.end()
#define ub upper_bound
#define lb lower_bound
#define maxe *max_element
#define mine *min_element
#define X INT_MAX
#define Y INT_MIN
#define sp " "


void take_input(vector<li> &v , int size){
    for (int i = 0; i <size ; ++i)
    {
        li k;
        cin>>k;
        v.pb(k);
    }
}

void printvec(vector<li> &v ){
for (int i = 0; i < v.size(); ++i)
{
    ct<<v[i]<<" ";
}
ct<<el;
}


//*********************************************************
void pranay_prasoon(){
li n,d;
cin>>n>>d;
vec v;
if (n==1)
{
    ct<<0<<el;
    return;
}
take_input(v,n);
isort(v);
vec count;
for (int i = 0; i < n; ++i)
{
    li ans=1;
    for (int j = n-1; j >i ; --j)
    {
        if (i==j)
        {
            continue;
        }
        if (v[j]-v[i]<=d && v[j]-v[i]>=0)
        {
            
            // ct<<v[i]<<sp<<v[j]<<el;
            ans++;
            // ct<<ans<<el;
            
        }

    }
      count.pb(ans);

}
 // printvec(count);
 ct<<n-maxe(all(count))<<el;











 }
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
    int queries=1;
    // cin >> queries;
    while (queries--)
    {
        pranay_prasoon();
    }
    return 0;
}