← Questions
Split tasks between two workers when one takes exactly k
0
I was asked this
No reports yet. Sign in to say where you were asked it.
There are n tasks. Worker one earns reward1[i] for task i and worker two earns reward2[i]. Every task goes to exactly one worker, and worker one must do exactly k tasks. Return the largest total reward.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding