You are given four integers numOnes, numZeros, numNegOnes, and k.

There is a bag containing items with numbers written on them:

• numOnes items with the number $1$

• numZeros items with the number $0$

• numNegOnes items with the number $-1$

Your task is to select exactly k items from the bag such that the sum of their values is maximized. Return the maximum possible sum.

Constraints:

• $0 \leq$ numOnes, numZeros, numNegOnes $\leq 50$

• $0 \leq$ k $\leq$ numOnes $+$ numZeros $+$ numNegOnes

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.