Problem:
Score : 300 points

Problem Statement

There are N candles placed on a number line.
The i-th candle from the left is placed on coordinate x_i.
Here, x_1 < x_2 < ... < x_N holds.

Initially, no candles are burning.
Snuke decides to light K of the N candles.

Now, he is at coordinate 0.
He can move left and right along the line with speed 1.
He can also light a candle when he is at the same position as the candle, in negligible time.

Find the minimum time required to light K candles.

Constraints

1 \leq N \leq 10^5

1 \leq K \leq N

x_i is an integer.

|x_i| \leq 10^8

x_1 < x_2 < ... < x_N

Input

Input is given from Standard Input in the following format:

N K
x_1 x_2 ... x_N

Output

Print the minimum time required to light K candles.

Sample Input 1

5 3
-30 -10 10 20 50

Sample Output 1

40

He should move and light candles as follows:

Move from coordinate 0 to -10.

Light the second candle from the left.

Move from coordinate -10 to 10.

Light the third candle from the left.

Move from coordinate 10 to 20.

Light the fourth candle from the left.

Sample Input 2

3 2
10 20 30

Sample Output 2

20

Sample Input 3

1 1
0

Sample Output 3

0

There may be a candle placed at coordinate 0.

Sample Input 4

8 5
-9 -7 -4 -3 1 2 3 4

Sample Output 4

10

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

"use strict";
    
const absOfArray = array => {
    const N = array.length;
    const temp = [];
    
    if(array.length === 1) {
        return array[0];
    }
    
    for(let i=1; i<N; i++) {
        temp.push(Math.abs(array[i-1] - array[i]));
    }
    
    return temp.reduce((m,n)=>m+n);
}

const main = arg => {
    arg = arg.trim().split("\n");
    const N = parseInt(arg[0].split(" ")[0]);
    let K = parseInt(arg[0].split(" ")[1]);
    const X = arg[1].split(" ").map(n=>parseInt(n));
    
    const minus = X.filter(n=>n<0).slice(-K);
    const plus  = X.filter(n=>n>0).slice(0, K);
    
    const newX = minus.concat([0]).concat(plus);
    
    let memo = absOfArray(newX.slice(0, K + 1));
    let answer = memo;
    
    // console.log(newX);
    
    if(K < newX.length) {
        console.log(memo);
        return;
    }
    
    for(let i=1; i<=N-K; i++) {
        memo -= Math.abs(newX[i-1] - newX[i]);
        memo += Math.abs(newX[i + K]);
        
        answer = Math.min(memo, answer);
    }
    
    console.log(answer);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));