Maximum Performance of a Team

Choose up to k engineers to maximize (sum of chosen speeds) * (minimum efficiency among them). Greedy solution: iterate engineers by descending efficiency while maintaining the k largest speeds (e.g., a min-heap) to update the maximum performance on the fly in O(n log k); return result mod 1e9+7.