Make Them Equal solution|educational Codeforces round 122 (rated for div 2)

D. Make Them Equal

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You have an array of integers a$a$ of size n$n$. Initially, all elements of the array are equal to 1$1$. You can perform the following operation: choose two integers i$i$ (1≤i≤n$1\le i\le n$) and x$x$ (x>0$x>0$), and then increase the value of ai$a_i$ by ⌊aix⌋$\lfloor \frac{a_i}{x}\rfloor$ (i.e. make ai=ai+⌊aix⌋$a_i=a_i+\lfloor \frac{a_i}{x}\rfloor$).

After performing all operations, you will receive ci$c_i$ coins for all such i$i$ that ai=bi$a_i=b_i$.

Your task is to determine the maximum number of coins that you can receive by performing no more than k$k$ operations.

Input

The first line contains a single integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases.

The first line of each test case contains two integers n$n$ and k$k$ (1≤n≤103;0≤k≤106$1\le n\le {10}^3;0\le k\le {10}^6$) — the size of the array and the maximum number of operations, respectively.

The second line contains n$n$ integers b1,b2,…,bn$b_1,b_2,\dots ,b_n$ (1≤bi≤103$1\le b_i\le {10}^3$).

The third line contains n$n$ integers c1,c2,…,cn$c_1,c_2,\dots ,c_n$ (1≤ci≤106$1\le c_i\le {10}^6$).

The sum of n$n$ over all test cases does not exceed 103${10}^3$.

Output

For each test case, print one integer — the maximum number of coins that you can get by performing no more than k$k$ operations.

Solution: 

solution link 1

https://shareus.in/?i=GZatxNl0g

if 1st link is not work then click on another link

Solution link 2

https://shrinke.me/0joa

Solution link 3

https://afly.pro/4dPM5oi

Solution link 4

https://afly.pro/X6gV2u4

How to get link tutorial video link

https://youtu.be/0TSsPHhgwb4