#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ldb long double
#define db double
#define fin(x) freopen(x,"r",stdin)
#define fout(x) freopen(x,"w",stdout)
#define fo(i,l,r) for(int i=(l);i<=(r);i++)
#define foi(i,l,r) for(int i=(l);i>=(r);i--)
#define el cout<<'\n';
#define cel cerr<<'\n';
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define gb(x,i) (((x)>>(i))&1)
#define mask(i) (1LL<<(i))
using namespace std;
const int N=2e5+5;
const int bl=60;
const ll base=1e9+7;
const ll inf=1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll l,ll r)
{
return l+(1ll*rng()*rng()%(r-l+1)+(r-l+1))%(r-l+1);
}
template<class X,class Y>bool maximize(X &a,Y b)
{
if(a<b) return a=b,true;
return false;
}
template<class X,class Y>bool minimize(X &a, Y b)
{
if(a>b) return a=b,true;
return false;
}
void add(auto &a,auto b)
{
a+=b;
if(a>=base) a-=base;
if(a<0) a+=base;
}
int n,diff,h[N];
namespace sub12567
{
ll dp[N],f[N];
deque<int>dq;
void solve()
{
fo(i,1,n)
{
fo(j,0,5e3) f[j]=1e18;
dq.clear();
fo(j,0,5e3)
{
while(dq.size() and dp[dq.back()]>=dp[j]) dq.pop_back();
dq.pb(j);
while(j-dq.front()>diff) dq.pop_front();
minimize(f[j],dp[dq.front()]);
}
dq.clear();
foi(j,5e3,0)
{
while(dq.size() and dp[dq.back()]>=dp[j]) dq.pop_back();
dq.pb(j);
while(dq.front()-j>diff) dq.pop_front();
minimize(f[j],dp[dq.front()]),f[j]+=abs(h[i]-j);
}
fo(j,0,5e3) dp[j]=f[j];
}
ll ans=1e18;
fo(i,0,5e3) minimize(ans,dp[i]);
cout<<ans;
}
}
int main()
{
#define task "o"
if(fopen(task".inp","r"))
{
fin(task".inp");
//fout(task".out");
}
srand(time(NULL));
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>diff;
fo(i,1,n) cin>>h[i];
if(n<=5e3)
{
sub12567::solve();
return 0;
}
if(!diff)
{
sort(h+1,h+n+1);
int x=h[(n+1)/2];
ll ans=0;
fo(i,1,n) ans+=abs(h[i]-x);
return cout<<ans,0;
}
}
