贪心、堆与设计题

sort(candidates, by=greedy_key)
state = initial
for candidate in candidates:
  if feasible(candidate, state): take(candidate); update(state)

heap = []
for item in stream:
  push(heap, item)
  if len(heap) > k: pop_top(heap)
return heap

get(key): locate in map → move node to recent end
put(key, value): update or insert → evict oldest if full