Maximize Intern Reward Points

Problem Statement

Maximize Intern Reward Points Problem Description Two interns at HackerRank are assigned to complete a total of `n` tasks. Each task can be completed by either intern. The first intern earns `reward_1[i]` points for finishing the `ith` task, while the second intern earns `reward_2[i]` points for the same task. To maximize the total reward points for both interns, determine the highest possible combined reward points if the first intern is required to complete `k` tasks, and the second intern completes the remaining tasks. Note: The `k` tasks for the first intern can be any of the `n` tasks. Complete the function `getMaximumRewardPoints` in the editor with the following parameters: `int k`: the number of tasks that have to be completed by intern 1 `int reward_1[n]`: the reward points earned by intern 1 for each task `int reward_2[n]`: the reward points earned by intern 2 for each task Returns: `int`: the maximum possible combined reward points when intern 1 completes exactly `k` tasks i