codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1633D.md (1590B)


      1 Source: https://codeforces.com/problemset/problem/1633/D
      2 
      3 D. Make Them Equal
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You have an array of integers $a$ of size $n$. Initially, all elements of the array are equal to $1$. You can perform the following operation: choose two integers $i$ ($1 \le i \le n$) and $x$ ($x \gt 0$), and then increase the value of $a_i$ by $\left\lfloor\frac{a_i}{x}\right\rfloor$ (i.e. make $a_i = a_i + \left\lfloor\frac{a_i}{x}\right\rfloor$).
     22 
     23 After performing all operations, you will receive $c_i$ coins for all such $i$ that $a_i = b_i$.
     24 
     25 Your task is to determine the maximum number of coins that you can receive by performing no more than $k$ operations.
     26 
     27 Input
     28 
     29 The first line contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases.
     30 
     31 The first line of each test case contains two integers $n$ and $k$ ($1 \le n \le 10^3; 0 \le k \le 10^6$) — the size of the array and the maximum number of operations, respectively.
     32 
     33 The second line contains $n$ integers $b_1, b_2, \dots, b_n$ ($1 \le b_i \le 10^3$).
     34 
     35 The third line contains $n$ integers $c_1, c_2, \dots, c_n$ ($1 \le c_i \le 10^6$).
     36 
     37 The sum of $n$ over all test cases does not exceed $10^3$.
     38 
     39 Output
     40 
     41 For each test case, print one integer — the maximum number of coins that you can get by performing no more than $k$ operations.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 
     50 4 4
     51 
     52 1 7 5 2
     53 
     54 2 6 5 2
     55 
     56 3 0
     57 
     58 3 5 2
     59 
     60 5 4 7
     61 
     62 5 9
     63 
     64 5 2 5 6 3
     65 
     66 5 9 1 9 7
     67 
     68 6 14
     69 
     70 11 4 6 2 8 16
     71 
     72 43 45 9 41 15 38
     73 ```
     74 
     75 Output
     76 
     77 ```
     78 9
     79 0
     80 30
     81 167
     82 ```