Submission #3784041

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

const int INF = 1e9;
const int mod = 1e9+7;

int main()
{
    int n,k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];

    int ans = INF;
    for(int i = 0; i + k <= n; i++){
        int z = a[i+k-1] - a[i] + min(abs(a[i]),abs(a[i+k-1]));
        if(ans > z) ans = z;
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result