Problem:
Score : 300 points

Problem Statement

You have N bamboos. The lengths (in centimeters) of these are l_1, l_2, ..., l_N, respectively.

Your objective is to use some of these bamboos (possibly all) to obtain three bamboos of length A, B, C. For that, you can use the following three kinds of magics any number:

Extension Magic: Consumes 1 MP (magic point). Choose one bamboo and increase its length by 1.

Shortening Magic: Consumes 1 MP. Choose one bamboo of length at least 2 and decrease its length by 1.

Composition Magic: Consumes 10 MP. Choose two bamboos and combine them into one bamboo. The length of this new bamboo is equal to the sum of the lengths of the two bamboos combined. (Afterwards, further magics can be used on this bamboo.)

At least how much MP is needed to achieve the objective?

Constraints

3 \leq N \leq 8

1 \leq C < B < A \leq 1000

1 \leq l_i \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N A B C
l_1
l_2
:
l_N

Output

Print the minimum amount of MP needed to achieve the objective.

Sample Input 1

5 100 90 80
98
40
30
21
80

Sample Output 1

23

We are obtaining three bamboos of lengths 100, 90, 80 from five bamboos 98, 40, 30, 21, 80. We already have a bamboo of length 80, and we can obtain bamboos of lengths 100, 90 by using the magics as follows at the total cost of 23 MP, which is optimal.

Use Extension Magic twice on the bamboo of length 98 to obtain a bamboo of length 100. (MP consumed: 2)

Use Composition Magic on the bamboos of lengths 40, 30 to obtain a bamboo of length 70. (MP consumed: 10)

Use Shortening Magic once on the bamboo of length 21 to obtain a bamboo of length 20. (MP consumed: 1)

Use Composition Magic on the bamboo of length 70 obtained in step 2 and the bamboo of length 20 obtained in step 3 to obtain a bamboo of length 90. (MP consumed: 10)

Sample Input 2

8 100 90 80
100
100
90
90
90
80
80
80

Sample Output 2

0

If we already have all bamboos of the desired lengths, the amount of MP needed is 0. As seen here, we do not necessarily need to use all the bamboos.

Sample Input 3

8 1000 800 100
300
333
400
444
500
555
600
666

Sample Output 3

243

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::vec::Vec;
use std::cmp;

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>().split_whitespace().map(|e| e.parse().ok().unwrap()).collect()
}

fn main() {
  let (n, a, b, c) = {
    let v: Vec<i64> = read_vec();
    (v[0], v[1], v[2], v[3])
  };

  let mut l: Vec<i64> = Vec::new();

  for _ in 0..n {
    let e: i64 = read();
    l.push(e);
  }

  // println!("{:?}", dfs1(n-1, &l, (a, b, c), (0, 0, 0), 0));

  let mut v: Vec<i64> = vec![-1; n as usize];
  let mut ans: i64 = 100000;
  let mut count = 0;

  dfs2(n as usize, (a, b, c), &l, &mut v, &mut ans);
  println!("{}", ans);
}

// 愚直なdfsの実装
fn dfs1(n: i64, l: &Vec<i64>, a: (i64, i64, i64), e: (i64, i64, i64), cost: i64) -> i64 {
  if n == -1 {

    if e.0 > 0 && e.1 > 0 && e.2 > 0 {
      // ここで切断や延長のマジックポイントを計算している
      // 最初の一本目を選ぶときに
      // 二本以上ないのに合成魔法を使ってマジックポイントを30使っている
      return cost + (e.0 - a.0).abs() + (e.1 - a.1).abs() + (e.2 - a.2).abs() - 30;
    }
    else {
      return 100000;
    }
  }

  let ret1: i64 = dfs1(n - 1, &l, a, e, cost);
  let ret2: i64 = dfs1(n - 1, &l, a, (e.0 + l[n as usize], e.1, e.2), cost + 10);
  let ret3: i64 = dfs1(n - 1, &l, a, (e.0, e.1 + l[n as usize], e.2), cost + 10);
  let ret4: i64 = dfs1(n - 1, &l, a, (e.0, e.1, e.2 + l[n as usize]), cost + 10);

  return [ret1, ret2, ret3, ret4].iter().fold(std::i64::MAX, |acc, i| cmp::min(acc, *i))
}


//
fn dfs2(n: usize, an: (i64, i64, i64), l: &Vec<i64>, v: &mut Vec<i64>, cost: &mut i64) {
  if n == 0 {
    let mut a: i64 = 0;
    let mut ac: i64 = 0;
    let mut b: i64 = 0;
    let mut bc: i64 = 0;
    let mut c: i64 = 0;
    let mut cc: i64 = 0;

    for i in 0..v.len() as usize {
        match v[i] {
          0 => { a += l[i as usize]; ac += 1;},
          1 => { b += l[i as usize]; bc += 1;},
          2 => { c += l[i as usize]; cc += 1;},
          _ => {},
        }
    }

  if ac > 0 && bc > 0 && cc > 0 {
    let co: i64 = (a - an.0).abs() + (b - an.1).abs() + (c - an.2).abs() + 10 * (ac + bc + cc - 3);
    *cost = cmp::min(*cost, co);
  }
    return;
  }

  for i in 0..4 {
    v[n-1] = i;
    dfs2(n-1, an, l,  v, cost);
  }
}