##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Repeated max access
What did you learn? When you repeatedly need the maximum (or minimum), use a heap.
Simulation problems often need heaps when the order of operations depends on current state.
Max-heap vs min-heap: choose based on whether you need the largest or smallest. This was simple. You'll handle a more interesting pattern: finding the k-th largest element.
