Submission #3784590

---

Source Code Expand

#include <iostream>

using namespace std;

int main(){
    long N, K;
    long x[100000];
    long min = __LONG_MAX__;
    cin >> N >> K;
    for(int i = 0; i < N; i++){
        cin >> x[i];
    }
    for(int i = 0; i <= N-K; i++){
        long tmp;
        if(abs(x[i]) < abs(x[i+K-1])){
            tmp = abs(x[i]) + x[i+K-1] - x[i];
        }else{
            tmp = abs(x[i+K-1]) + x[i+K-1] - x[i];
        }
        if(tmp < min) min = tmp;
    }
    cout << min << endl;
}

Submission Info

Judge Result