You are given two integer arrays, technique1 and technique2, each of length n, and an integer k.

There are n tasks. For each task i, you can choose to complete it using technique $1$ to receive technique1[i] points, or using technique $2$ to receive technique2[i] points.

You must complete at least k tasks using technique $1$. Every task must be completed using exactly one of the two techniques.

Return the maximum total points you can accumulate after completing all n tasks.

Constraints:

• $1 \leq n ==$ technique1.length $==$ technique2.length $\leq 10^5$

• $1 \leq$ technique1[i], technique2[i] $\leq 10^5$

• $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.