#3767

Maximize Points After Choosing K Tasks

specialist · 725 · lc medium +31 · 60% accepted · 66 likes · top 58%

Description

Given two integer arrays technique1 and technique2 of length n representing point rewards per task and an integer k, assign each task to exactly one technique subject to the constraint that at least k tasks use technique 1, and return the maximum total points achievable when remaining tasks may freely choose either technique.

Code

1

2

3

class Solution:
    def maxPoints(self, technique1: List[int], technique2: List[int], k: int) -> int:

class Solution:
    def maxPoints(self, technique1: List[int], technique2: List[int], k: int) -> int: