There are two mice and $n$ different types of cheese. Each type of cheese must be eaten by exactly one mouse.

If the first mouse eats the $i^{ ext{th}}$ type of cheese, the mice achieve reward1[i] points. If the second mouse eats the $i^{ ext{th}}$ type of cheese, the mice achieve reward2[i] points.

Given two integer arrays reward1 and reward2 of length $n$, and an integer k, return the maximum total points the mice can achieve if the first mouse eats exactly k types of cheese and the second mouse eats the remaining $n - k$ types of cheese.

Constraints:

• $1 \leq n ==$ reward1.length $==$ reward2.length $\leq 10^5$

• $1 \leq$ reward1[i], reward2[i] $\leq 1000$

• $0 \leq$ k $\leq n$

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.