CF1132E.Knapsack

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You have a set of items, each having some integer weight not greater than $8$ . You denote that a subset of items is good if total weight of items in the subset does not exceed $W$ .

You want to calculate the maximum possible weight of a good subset of items. Note that you have to consider the empty set and the original set when calculating the answer.

输入格式

The first line contains one integer $W$ ( $0 \le W \le 10^{18}$ ) — the maximum total weight of a good subset.

The second line denotes the set of items you have. It contains $8$ integers $cnt_1$ , $cnt_2$ , ..., $cnt_8$ ( $0 \le cnt_i \le 10^{16}$ ), where $cnt_i$ is the number of items having weight $i$ in the set.

输出格式

Print one integer — the maximum possible weight of a good subset of items.

输入输出样例

输入#1
```
10
1 2 3 4 5 6 7 8
```
输出#1
```
10
```
输入#2
```
0
0 0 0 0 0 0 0 0
```
输出#2
```
0
```
输入#3
```
3
0 4 1 0 0 9 8 3
```
输出#3
```
3
```

首页