对于一个给定的区间.其最优解一定是中位数.用splay维护区间的权值.
/* I will wait for you */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#define make make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int maxn=200010;
const int maxm=1010;
const int maxs=26;
const int INF=1<<29;
const int P=1000000007;
const double error=1e-9;
struct node
{
LL c,size,sum;node *fa,*son[2];
inline int cmp(int m) { return c<m; }
inline int dir() { return this==fa->son[1]; }
}*root=0,*su[maxn],no[maxn];
int n,k,cnt;LL ans=(LL)INF*(LL)INF;
inline node* make(int m,node* p)
{
node* o=&no[cnt++];
o->c=o->sum=(LL)m;o->size=1;
o->fa=p;o->son[0]=o->son[1]=0;
return o;
}
inline void maintain(node* o)
{
o->size=1;o->sum=o->c;
for(int i=0;i<2;i++) if(o->son[i])
{
o->son[i]->fa=o;
o->size+=o->son[i]->size;
o->sum+=o->son[i]->sum;
}
}
inline void rotate(node* o)
{
node* p=o->fa;int d=o->dir();
p->son[d]=o->son[d^1];
o->son[d^1]=p;o->fa=p->fa;
if(p->fa) p->fa->son[p->dir()]=o;
maintain(p);
}
inline void splay(node* o,node* f)
{
while(o->fa!=f)
{
node* p=o->fa;
if(p->fa==f) rotate(o);
else if(o->dir()==p->dir()) rotate(p),rotate(o);
else rotate(o),rotate(o);
}
maintain(o);if(!f) root=o;
}
inline node* per(node* o)
{
splay(o,0);o=o->son[0];while(o->son[1]) o=o->son[1];return o;
}
inline node* next(node* o)
{
splay(o,0);o=o->son[1];while(o->son[0]) o=o->son[0];return o;
}
inline void del(node* o)
{
node *l=per(o),*r=next(o);
splay(l,0);splay(r,l);
r->son[0]=0;r->size--;r->sum-=o->c;
}
inline node* insert(node* &o,node* p,int c)
{
if(!o) return o=make(c,p);
else return insert(o->son[o->cmp(c)],o,c);
}
inline node* find(node* o,int k)
{
int ls=o->son[0]?o->son[0]->size:0;
if(k<=ls) return find(o->son[0],k);
else if(k==ls+1) return o;
else if(k>ls+1) return find(o->son[1],k-ls-1);
}
inline LL slove()
{
node* o=find(root,(k+3)/2);splay(o,0);
LL l=(o->son[0]->size-1)*o->c-(o->son[0]->sum+INF);
LL r=(o->son[1]->sum-INF)-(o->son[1]->size-1)*o->c;
return l+r;
}
int main()
{
scanf("%d%d",&n,&k);
insert(root,0,-INF),insert(root,0,INF);
for(int i=1,c;i<k;i++) scanf("%d",&c),splay(su[i]=insert(root,0,c),0);
for(int i=k,c;i<=n;i++)
{
scanf("%d",&c),splay(su[i]=insert(root,0,c),0);
ans=min(ans,slove()),del(su[i-k+1]);
}
printf("%lld\n",ans);
return 0;
}