Split tasks between two workers when one takes exactly k

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.