Submission #3439496

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int n,k,i,ans=999999999,a[200001];

int main(){
	cin >> n >> k;
	for(i=1;i<=n;i++)
		cin >> a[i];
	sort(a+1,a+n+1);
	for(i=k;i<=n;i++)
		if(a[i-k+1]>=0)
			ans=min(ans,a[i]);
		else if(a[i]<=0)
			ans=min(ans,-a[i-k+1]);
		else
			ans=min(ans,a[i]-a[i-k+1]+min(-a[i-k+1],a[i]));
	cout << ans;
	return 0;
}

Submission Info

Judge Result