Maximize Points After Choosing K Tasks
You are given two integer arrays, technique1 and technique2, each of length n, where n represents the number of tasks to complete.
- If the
i^thtask is completed using technique 1, you earntechnique1[i]points. - If it is completed using technique 2, you earn
technique2[i]points.
You are also given an integer k, representing the minimum number of tasks that must be completed using technique 1.
You must complete at least k tasks using technique 1; they do not need to be the first k tasks.
The remaining tasks may be completed using either technique.
Return an integer denoting the maximum total points you can earn.
Example 1
Input
technique1 = [5,2,10], technique2 = [10,3,8], k = 2Output
22Choosing
technique1[1] and technique1[2] using technique 1 and technique2[0] using technique 2 gives 2 + 10 + 10 = 22, which is maximum.Example 2
Input
technique1 = [10,20,30], technique2 = [5,15,25], k = 2Output
60Choosing all tasks using technique 1 gives
10 + 20 + 30 = 60, which is maximum.Constraints
- 1 <= n == technique1.length == technique2.length <= 10^5
- 1 <= technique1[i], technique2[i] <= 10^5
- 0 <= k <= n