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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

var n,k,i,aa,x,count,min,bb:integer;
a,b:array[1..100000]of integer;
begin 
	read(n,k);
	min:=maxint;
	i:=1;
	read(x);
	while x<0 do 
	begin 
		a[i]:=-x;
		inc(i);
		read(x);
	end;
	if x=0 then begin dec(k);dec(n);if k<>0 then read(x);end;
	aa:=i-1;bb:=n-aa;
	b[1]:=x;
	for i:=2 to n-aa do read(b[i]);
	for i:=0 to k do 
		if (aa>=i) and (bb>=k-i) then
		begin 
			if a[aa-i+1]>b[k-i] then count:=2*b[k-i]+a[aa-i+1]
				else count:=2*a[aa-i+1]+b[k-i];
		    if min>count then min:=count;
		end;
	write(min);
end.