2558. 从最富有的堆中取礼物
Easy | Array, Heap (Priority Queue), Simulation
Easy | Array, Heap (Priority Queue), Simulation
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation
Medium | Array, Greedy, Sorting, Heap (Priority Queue)
Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack
Medium | Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)
Medium | Array, Greedy, Sorting, Heap (Priority Queue)
Hard | Array, Heap (Priority Queue)
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Hard | Array, Greedy, Sorting, Heap (Priority Queue)