0 人解决，10 人已尝试。
0 份提交通过，共有 23 份提交。
9.9 EMB 奖励。
单点时限: 10.0 sec
内存限制: 256 MB
In the downtown of Bucharest there is a very big bank with a very big vault. Inside the vault there are N very big boxes numbered from 1 to N. Inside the box with number k there are k very big diamonds, each of weight Wk and cost Ck.
John and Brus are inside the vault at the moment. They would like to steal everything, but unfortunately they are able to carry diamonds with the total weight not exceeding M.
Your task is to help John and Brus to choose diamonds with the total weight less than or equal to M and the maximal possible total cost.
The first line contains single integer T – the number of test cases. Each test case starts with a line containing two integers N and M separated by a single space. The next line contains N integers Wk separated by single spaces. The following line contains N integers Ck separated by single spaces.
For each test case print a single line containing the maximal possible total cost of diamonds.
Constraints:
1 ≤ T ≤ 74,
1 ≤ N ≤ 15,
1 ≤ M ≤ 1000000000 (109),
1 ≤ Wk, Ck ≤ 1000000000 (109).
2 2 4 3 2 5 3 3 100 4 7 1 5 9 2
6 29
0 人解决，10 人已尝试。
0 份提交通过，共有 23 份提交。
9.9 EMB 奖励。
创建: 15 年前.
修改: 7 年，2 月前.
最后提交: 3 年，12 月前.