You are given two integer arrays price and tastiness, both of length n, where price[i] and tastiness[i] represent the price and tastiness of the $i^{ ext{th}}$ fruit, respectively. You are also given two integers maxAmount and maxCoupons.

You want to maximize the total tastiness of the fruits you purchase subject to the following rules:

• You can purchase each fruit at most once.

• You have a total budget of at most maxAmount.

• You can use at most maxCoupons discount coupons. Each coupon can be applied to at most one fruit, reducing its price to $\lfloor$ price[i] $/ 2 \rfloor$.

Return the maximum total tastiness you can obtain.

Constraints:

• n == price.length == tastiness.length

• $1 \leq$ n $\leq 100$

• $0 \leq$ price[i], tastiness[i], maxAmount $\leq 1000$

• $0 \leq$ maxCoupons $\leq 5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.