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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

public class Main {

    static int result = 0;
    static int totalStep = 0;
    static int k = 0;
    static int d = 0;
    static  int n = 0;
    public static void main(String[] args) {
       // System.setIn(new FileInputStream("D:/samleInput.txt"));
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        k = sc.nextInt();
        int []input = new int[n];
        int leftFlag = 0;
        int rightFlag = 0;
        int zeroFlag = 0;
        int leftFirst = -1;
        int rightFirst = -1;
        for (int i = 0; i < n; i++) {
            int location = sc.nextInt();
            input[i] = location;
            if (location>0){
                rightFlag = 1;
                if(rightFirst == -1){
                    rightFirst = i;
                }

            }else if(location == 0){
                zeroFlag = 1;
            }else {
                leftFlag = 1;
                leftFirst = i;

            }
        }
        if(rightFlag == 1 &&leftFlag == 0 ){
            result += Math.abs(input[k-1]);

        }else if(rightFlag == 0 &&leftFlag == 1 ){
            result = Math.abs(input[n-k]);
        }else if (rightFlag == 1 &&leftFlag == 1 ){
                int count=0;
               int  leftResult =Math.abs(input[leftFirst])*2;
            if(zeroFlag == 0){
                while(count<k-1){
                    if(count == 0){
                        leftResult +=Math.abs(input[rightFirst+count]);
                    }else{
                        leftResult +=Math.abs(input[rightFirst+count]-input[rightFirst+count-1]);
                    }

                    count++;
                }
            }else {
                while(count<k-2){
                    if(count == 0){
                        leftResult +=Math.abs(input[rightFirst+count]);
                    }else {
                        leftResult +=Math.abs(input[rightFirst+count]-input[rightFirst+count-1]);
                    }
                    count++;
                }
            }

            int count1=0;
            int  rightResult =Math.abs(input[rightFirst])*2;
            if(zeroFlag == 0){
                while(count1<k-1){

                    if(count1 == 0){
                        rightResult +=Math.abs(input[leftFirst-count1]);
                    }else{
                        rightResult +=Math.abs(input[leftFirst-count1]-input[leftFirst-count1+1]);
                    }
                    count1++;
                }
            }else {
                while(count1<k-2){
                    if(count1 == 0){
                        rightResult +=Math.abs(input[leftFirst-count1]);
                    }else
                    {
                        rightResult +=Math.abs(input[leftFirst-count1]-input[leftFirst-count1+1]);
                    }

                    count1++;
                }
            }

            if(rightResult-leftResult<0){
                result = rightResult;
            }else {
                result = leftResult;
            }

        }
        System.out.println(result);
        }
}