Maximize Combined Reward Points

Problem Statement

Maximize Combined 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 i -th task, while the second intern earns reward_2[i] points for the same task. The first intern is required to complete exactly k tasks, and the second intern will complete the remaining N-k tasks. Your goal is to determine the highest possible combined reward points for both interns. The function signature is as follows: /* * Complete the 'getMaximumRewardPoints' function below. * * The function is expected to return an INTEGER. * The function accepts following parameters: * 1. INTEGER k * 2. INTEGER_ARRAY reward_1 * 3. INTEGER_ARRAY reward_2 */ int getMaximumRewardPoints(int k, vector<int> reward_1, vector<int> reward_2) { // Function implementation } The function should return an int representing the maximum possible combined reward points when i