3066. 使数组元素大于等于阈值的最小操作数 II
Medium | Array, Heap (Priority Queue), Simulation
Medium | Array, Heap (Priority Queue), Simulation
Medium | Array, Hash Table, Sorting, Heap (Priority Queue), Simulation
Medium | Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
Medium | Array, Hash Table, Heap (Priority Queue), Ordered Set
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path
Medium | Hash Table, String, Stack, Greedy, Heap (Priority Queue)
Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Path
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
Medium | Array, Sorting, Heap (Priority Queue), Matrix, Simulation
Hard | Graph Theory, Heap (Priority Queue), Shortest Path
Medium | Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue
Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Hard | Array, Hash Table, Stack, Greedy, Sorting, Heap (Priority Queue)
Hard | Array, Greedy, Sorting, Heap (Priority Queue), Matrix
Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack
Medium | Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue
Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Path
Medium | Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set
Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)