NeetCode #550LC-1383HardHeap / Priority Queue
← Back to All Problems#550 · #1383 · Maximum Performance of a Team(最大的团队表现值)
📌 Problem Statement & Constraints
You are given
n engineers with speed[i] and efficiency[i]. Choose at most k engineers to maximise (sum of speeds) * (minimum efficiency in the team). Return the answer modulo 10^9 + 7. Constraints: 1 <= n <= 10^5, 1 <= k <= n, 1 <= speed[i], efficiency[i] <= 10^8.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!