K Items With the Maximum Sum

There is a bag that consists of items, each item has a number 1, 0, or -1 written on it.

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

The bag initially contains:

• numOnes items with 1s written on them.

• numZeroes items with 0s written on them.

• numNegOnes items with -1s written on them.

We want to pick exactly k items among the available items. Return the maximum possible sum of numbers written on the items.

LeetCode Problem - 2600

class Solution {
    public int kItemsWithMaximumSum(int numOnes, int numZeros, int numNegOnes, int k) {
        int result = 0; // Initialize result to store the sum of selected items.

        // Process 'k' items to maximize the sum.
        while (k > 0) {
            if (numOnes > 0) {
                // If there are '1's available, add 1 to the result and decrease their count.
                result++;
                numOnes--;
            } else if (numZeros > 0) {
                // If no '1's are left but there are '0's, simply decrement their count.
                // Adding 0 does not change the result.
                numZeros--;
            } else {
                // If no '1's or '0's are left, use '-1's.
                // Subtract 1 from the result and decrease the count of '-1's.
                result--;
                numNegOnes--;
            }
            k--; // Decrease the count of items to process.
        }

        return result; // Return the final maximum sum.
    }
}