最大的团队表现值

// Java Stream solution for the problem
// Idea: Similar to the Java solution, we will use streams to sort the engineers by efficiency and then use a priority queue for speeds.
// We will calculate the performance as the sum of the speeds in the team multiplied by the minimum efficiency.

import java.util.*;
import java.util.stream.*;

class Solution {
    public int maxPerformance(int n, int[] speed, int[] efficiency, int k) {
        int MOD = 1000000007;

        // Create a list of engineers using streams
        List<int[]> engineers = IntStream.range(0, n)
            .mapToObj(i -> new int[]{efficiency[i], speed[i]})
            .sorted((a, b) -> Integer.compare(b[0], a[0]))
            .collect(Collectors.toList());

        PriorityQueue<Integer> speedHeap = new PriorityQueue<>(k, Comparator.comparingInt(a -> a));
        long totalSpeed = 0, maxPerformance = 0;

        for (int[] engineer : engineers) {
            totalSpeed += engineer[1];
            speedHeap.add(engineer[1]);

            if (speedHeap.size() > k) {
                totalSpeed -= speedHeap.poll();
            }

            maxPerformance = Math.max(maxPerformance, totalSpeed * engineer[0]);
        }

        return (int) (maxPerformance % MOD);
    }
}