# Minimum Cost To Hire K Workers: Practice Notes
Minimum Cost To Hire K Workers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort workers by wage/quality ratio. Scan in increasing ratio and keep a max-heap of the k qualities seen so far. Cost of a team is current_ratio * sumQuality; pop the largest quality whenever the heap exceeds k.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n log n).
## Common mistake
Picking the k cheapest wages, which ignores that one high-ratio worker forces everyone else up.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://www.linkjob.ai/.