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 Rust (1.15.1) (judge verdict: Runtime Error)

#![allow(unused_imports)]
#![allow(non_snake_case)]

use std::cell::RefCell;
use std::cmp::{max, min, Ordering};
use std::collections::*;
use std::fmt::{Debug, Formatter, Write as FmtWrite};
use std::io::{stderr, stdin, BufRead, Write};
use std::iter::*;
use std::mem::{replace, swap};
use std::ops::*;
use std::rc::Rc;
// -----------------------------------------------
// Framework
// -----------------------------------------------

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($arg:expr),*) => {
        #[cfg(debug_assertions)]
        $(writeln!(stderr(), "{} = {:?}", stringify!($arg), $arg).unwrap());*
    };
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    stdin().read_line(&mut buf).unwrap();
    buf.trim_right().to_owned()
}

trait IteratorExt: Iterator + Sized {
    fn vec(self) -> Vec<Self::Item> {
        self.collect()
    }
}

impl<T: Iterator> IteratorExt for T {}

// -----------------------------------------------
// Solution
// -----------------------------------------------
fn abs(num: i32) -> i32 {
    if num >= 0 {
        num
    } else {
        -num
    }
}
fn main() {
    let (n, k) = read!(i32, i32);
    let candles = read!([i32]);
    let mut pos = -1;
    for (i, _pos) in candles.iter().enumerate() {
        if *_pos > 0 {
            pos = i as i32;
            break;
        }
    }
    let mut answer: i32 = 0;
    if pos == -1 {
        answer += abs(candles[(n - k) as usize]);
        println!("{}", answer);
        return;
    }
    if pos == 0 {
        answer += candles[(k - 1) as usize];
        println!("{}", answer);
        return;
    }
    answer = 2000000000 + 7;
    let mut cnt = 0;
    for i in (max(pos - k, 0)..pos).rev() {
        cnt += 1;
        let mut _answer = abs(candles[i as usize]);
        if k - cnt - 1 >= 0 && pos + k - cnt - 1 < n {
            _answer += _answer;
            _answer += candles[(pos + k - cnt - 1) as usize];
        } else {
            continue;
        }
        answer = min(answer, _answer);
    }
    // debug!(pos);

    cnt = 0;
    for i in pos..min(pos + k, n - 1) {
        cnt += 1;
        let mut _answer = abs(candles[i as usize]);
        if k - cnt >= 0 && pos - k + cnt < n {
            _answer += _answer;
            _answer += abs(candles[(pos - k + cnt) as usize]);
        } else {
            continue;
        }
        answer = min(answer, _answer);
        // debug!(i, _answer, answer);
    }
    println!("{}", answer);
}