#2600

K Items With the Maximum Sum

pupil · 385 · lc easy +24 · verified · 60.2% accepted · 336 likes · top 59%

Description

A bag holds numOnes items labeled 1, numZeros items labeled 0, and numNegOnes items labeled -1. Choose exactly k items to maximize the sum. Return the maximum possible sum.

Example 1:

Input: numOnes = 3, numZeros = 2, numNegOnes = 0, k = 2

Output: 2

Explanation: We have a bag of items with numbers written on them {1, 1, 1, 0, 0}. We take 2 items with 1 written on them and get a sum in a total of 2.

It can be proven that 2 is the maximum possible sum.

Example 2:

Input: numOnes = 3, numZeros = 2, numNegOnes = 0, k = 4

Output: 3

Explanation: We have a bag of items with numbers written on them {1, 1, 1, 0, 0}. We take 3 items with 1 written on them, and 1 item with 0 written on it, and get a sum in a total of 3.

It can be proven that 3 is the maximum possible sum.

Code

1

2

3

class Solution:
    def kItemsWithMaximumSum(self, numOnes: int, numZeros: int, numNegOnes: int, k: int) -> int:

class Solution:
    def kItemsWithMaximumSum(self, numOnes: int, numZeros: int, numNegOnes: int, k: int) -> int: