Problem Statement
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate xi. Here, x1
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long LL;
int main()
{
int n,k;
LL a[100005];
while(scanf("%d%d",&n,&k)==2){
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
}
LL l,r,ans=inf;
for(int i=1;i+k-1<=n;i++){
l=a[i],r=a[i+k-1];
if(l*r>0){
ans=min(ans,max(abs(l),abs(r)));
}
else{
ans=min(ans,r-l+min(abs(l),abs(r)));
}
}
printf("%lld\n",ans);
}
return 0;
}