AtCoder Beginner Contest 119
翻译中…
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.
翻译中…
样例
Input #1
5 100 90 80
98
40
30
21
80
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.
1. Use Extension Magic twice on the bamboo of length $98$ to obtain a bamboo of length $100$. (MP consumed: $2$)
2. Use Composition Magic on the bamboos of lengths $40, 30$ to obtain a bamboo of length $70$. (MP consumed: $10$)
3. Use Shortening Magic once on the bamboo of length $21$ to obtain a bamboo of length $20$. (MP consumed: $1$)
4. 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$)
Input #2
8 100 90 80
100
100
90
90
90
80
80
80
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.
Input #3
8 1000 800 100
300
333
400
444
500
555
600
666
Output #3
243
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。