Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Heaps & priority queues

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Heaps & priority queues

Maximum Performance of a Team

advancedlayer I3 · Heaps & priority queues5 tests

There are n engineers; engineer i has speed[i] and efficiency[i]. Pick at most k of them to maximise the team's performance, defined as the sum of their speeds multiplied by the minimum efficiency among the chosen engineers.

  • You may pick fewer than k engineers if that is better
  • Return the maximum performance as a plain number — the test inputs are small enough that no modulo is needed
  • A MinHeap class is already written for you in the starter — you only need the algorithm

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen