Score : 300 points
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:
At least how much MP is needed to achieve the objective?
Input is given from Standard Input in the following format:
N A B C l_1 l_2 : l_N
Print the minimum amount of MP needed to achieve the objective.
5 100 90 80 98 40 30 21 80
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.
8 100 90 80 100 100 90 90 90 80 80 80
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.
8 1000 800 100 300 333 400 444 500 555 600 666
243