Solution: Maximum Performance of a Team
Understand how to apply the Top K Elements pattern with a greedy strategy to form a team that maximizes performance. This lesson walks you through sorting engineers by efficiency, managing speeds with a min-heap, and calculating the highest product of sum of speeds and minimum efficiency. You will learn to implement an efficient algorithm to find maximum team performance under given constraints.
We'll cover the following...
Statement
You are given two integers, n and k, and two integer arrays, speed and efficiency, both of length n. There are n engineers numbered from 1 to n. The value speed[i] represents the speed of the i-th engineer, and efficiency[i] represents their efficiency.
To form a team with the maximum performance, you need to select at most k different engineers from the n engineers.
The performance of a team is calculated as follows:
The sum of the selected engineers’ speeds
Return the maximum performance of the team. As the result can be a very large number, return it modulo
Constraints:
kn...