You are given two $0$ indexed integer arrays nums1 and nums2 of length n, and a positive integer k.

Choose a subsequence of indices of length k. The score of selecting these indices is defined as the sum of the chosen elements in nums1 multiplied by the minimum of the chosen elements in nums2.

Return the maximum possible score.

Constraints:

• n $==$ nums1.length $==$ nums2.length

• $1 \leq$ n $\leq 10^5$

• $0 \leq$ nums1[i], nums2[j] $\leq 10^5$

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