You are given two integer arrays values and labels of length $n$, and two integers numWanted and useLimit. The value and label of the item at index $i$ are values[i] and labels[i], respectively.

Find the maximum possible sum of values from a subset of items such that:

• The subset contains at most numWanted items.

• For each label, the subset contains at most useLimit items with that label.

Return the maximum sum that can be obtained.

Constraints:

• n == values.length == labels.length

• $1 \le n \le 2 \cdot 10^4$

• $0 \le$ values[i], labels[i] $\le 2 \cdot 10^4$

• $1 \le$ numWanted, useLimit $\le 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.