Question 1

Problem Statement

Question 1 Problem Description A company needs to divide n employees into k teams. The skill level of the i th employee is given by empSkill[i] , and the size of the j th team is teamSize[j] (for 0 ≤ j < k ). A team's strength is defined as the sum of the minimum and maximum skills of the employees in that team. Determine the maximum possible sum of team strengths, ensuring each employee is assigned to exactly one team. Function Description Complete the function getMaximumStrengthSum in the editor below. Function Parameters int empSkill[n] : the skills of the employee. int teamSize[k] : the sizes of the teams. Returns long : the maximum possible sum of strengths of the teams. Examples Example 1 Consider the following input: n = 5 k = 3 empSkill = [1, 10, 5, 9, 9] teamSize = [1, 1, 3] Some of the team combinations are explained below: [1], [10], [5, 9, 9] - Total strength = (1 + 1) + (10 + 10) + (5 + 9) = 36 . [5], [9], [1, 10, 9] - Total strength = (5 + 5) + (9 + 9) + (1 + 10) =