pq

lc

dijk

lc3781

pq最小堆 维护动态前k大

class Solution {
public:
long long maximumScore(vector<int>& nums, string s) {
priority_queue<int, vector<int>, greater<>> pq;
long long ans = 0;
for (int i = nums.size() - 1; i >= 0; i--) {
int x = nums[i];
ans += x;
pq.push(x);
if (s[i] == '0') {
ans -= pq.top();
pq.pop();
}
}
return ans;
}
};