3462. Maximum Sum With at Most K Elements
You are given a 2D integer matrix grid of size n x m, an integer array limits of length n, and an integer k. The task is to find the maximum sum of at…
Tag: Heap
1368. Minimum Cost to Make at Least One Valid Path in a Grid
二维坐标转换为一维索引的公式 在一个有 m 行、n 列的网格中，可以用公式将坐标 (x, y) 转换为一维索引 cur_pos：cur_pos = x * n + y 逆向转换：一维索引到二维坐标 如果需要从一维索引恢复二维坐标 (x, y)： x = cur_pos // n（整除获取行号）…
3419. Minimize the Maximum Edge Weight of Graph
‘Node 0 must be reachable from all other nodes.’ means 0 is the root of a tree. And because we are going to remove…
3408. Design Task Manager
Point is: we don’t have to remove items immediately from heap after rmv / edit operation. Do it when we are going to execTop.