Submission #3600798

---

Source Code Expand

#include<iostream>
#include<utility>
#include<algorithm>
#include<vector>
#define all(v) v.begin(),v.end()
#define pb push_back
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define INF 1e9
using namespace std;
typedef pair<long long,int> pli;

long long func(long long a){
	if(a<0)return -a;
	else return a;
}

long long min(long long a,long long b){
	if(a<b)return a;
	else return b;
}

int main(){
	int n,k;
	cin>>n>>k;
	long long val[n];
	rep(i,n)cin>>val[i];
	long long ans=INF;
	rep(i,n-k+1){
		if(val[i]>=0)ans=min(ans,val[i+k-1]);
		else if(val[i+k-1]<0)ans=min(ans,func(val[i]));
		else{
			ans=min(ans,min(func(val[i])*2+func(val[i+k-1]),func(val[i])+2*func(val[i+k-1])));
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result