Maximum Performance of a Team (H)
There are n
engineers numbered from 1 to n
and two arrays: speed
and efficiency
, where speed[i]
and efficiency[i]
represent the speed and efficiency for the i-th engineer respectively. Return the maximum performance of a team composed of at most k
engineers, since the answer can be a huge number, return this modulo 10^9 + 7.
The performance of a team is the sum of their engineers’ speeds multiplied by the minimum efficiency among their engineers.
Example 1:
Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2
Output: 60
Explanation:
We have the maximum performance of the team by selecting engineer 2 (with speed=10 and efficiency=4) and engineer 5 (with speed=5 and efficiency=7). That is, performance = (10 + 5) * min(4, 7) = 60.
Example 2:
Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 3
Output: 68
Explanation:
This is the same example as the first but k = 3. We can select engineer 1, engineer 2 and engineer 5 to get the maximum performance of the team. That is, performance = (2 + 10 + 5) * min(5, 4, 7) = 68.
Example 3:
Input: n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 4
Output: 72
Constraints:
1 <= n <= 10^5
speed.length == n
efficiency.length == n
1 <= speed[i] <= 10^5
1 <= efficiency[i] <= 10^8
1 <= k <= n
题意
从n个员工中选出至多k个组成一支队伍,要求这支队伍的performance最大。performance定义为sum(speed)*min(efficiency)。
思路
具体解释可见[Java] Detailed Explanation - PriorityQueue - O(NlogN)。
主要思想是按照efficiency降序排序,从上到下每次固定一个efficiency,使对应的speed之和尽可能大(即选取人数尽可能多),如果人数超过k,则将一个最小的speed删去(使用最小堆来处理),不断更新performance来得到答案。
代码实现
class Solution {
public int maxPerformance(int n, int[] speed, int[] efficiency, int k) {
int[][] engineers = new int[n][];
for (int i = 0; i < n; i++) {
engineers[i] = new int[]{efficiency[i], speed[i]};
}
Arrays.sort(engineers, (int[] a, int[] b) -> (b[0] - a[0]));
Queue<Integer> pq = new PriorityQueue<>();
long sum = 0, res = 0;
for (int[] engineer : engineers) {
pq.offer(engineer[1]);
sum += engineer[1];
if (pq.size() > k) {
sum -= pq.poll();
}
res = Math.max(res, sum * engineer[0]);
}
return (int) (res % (long) (1e9 + 7));
}
}