Bank Notes

View as PDF

Submit solution

All submissions

Best submissions

Points: 7

Time limit: 0.6s

Memory limit: 64M

Problem type

Note: This problem is an easier version of the POI problem Bank Notes from 2005.

The Byteotian Bit Bank (BBB) has the largest network of cash dispensers in the whole Byteotia. The BBB have decided to improve their dispensers and have asked you for help. The legal tender in Byteotia are bank notes of denominations $b_1, b_2, \dots, b_n$ $b_{1}, b_{2}, \dots, b_{n}$ . The BBB have concluded that the cash dispensers are to pay every sum in the smallest possible total number of notes.

Task

Write a programme that:

reads from the standard input the description of the dispenser's notes stock and the sum to be paid off,
determines the minimal total number of bank notes sufficient to pay the desired sum off,
writes the result to the standard output.

Input

In the first line of the standard input the number of denominations is written $n$ $n$ , $1 \le n \le 200$ $1 \leq n \leq 200$ . The second line contains $n$ $n$ integers $b_1, b_2, \dots, b_n$ $b_{1}, b_{2}, \dots, b_{n}$ $(1 \le b_i \le 20\,000)$ $(1 \leq b_{i} \leq 20 000)$ , separated by a single space. The third line contains $n$ $n$ integers $c_1, c_2, \dots, c_n$ $c_{1}, c_{2}, \dots, c_{n}$ $(1 \le c_i \le 20\,000)$ $(1 \leq c_{i} \leq 20 000)$ , also separated by a single space; $c_i$ $c_{i}$ is the number of bank notes of denomination $b_i$ $b_{i}$ left in the cash dispenser. In the last, fourth line of input there is one integer $k$ $k$ $(1 \le k \le 20\,000)$ $(1 \leq k \leq 20 000)$ - the sum to be paid off. For the test data, you are free to assume that the sum can be paid off in the available bank notes.

Output

The standard output should contain one integer denoting the minimal total number of bank notes sufficient to pay the sum off $k$ $k$ .

Sample Input

Copy

Sample Output

Copy

Comments

1

DynamicSquid commented on Feb. 15, 2021, 5:05 p.m.

I'm getting WA on half of the tests, and I can't figure out why. What am I missing?

1

Xiang_li commented on Aug. 8, 2021, 2:19 a.m.

Your code doesn't work because it's wrong. Try this: 2 11 2 1 6 12 Your code outputs 2.

3

4fecta commented on Sept. 7, 2019, 2:46 p.m. ← edited →

How is this an easier version of POI - Bank Notes? I checked the constraints and they're both $2 \times 10^4$ $2 \times 10^{4}$ . Is the data weaker?

5

chika commented on Sept. 7, 2019, 3:48 p.m.

If you read the official problem statement, you'll see that you need to reconstruct the set of bank notes needed to reach the desired sum. The DMOJ problem does not require this and consequently that makes the DMOJ problem easier.

3

4fecta commented on Sept. 7, 2019, 3:52 p.m.

Thanks for the explanation.

8
kobortor commented on July 22, 2018, 2:37 a.m.
Weak testdata:

The following testcase kills my solution

Input

Copy
3 11 4 1 1 3 1 12

Output

Copy
2