手写堆优先队列

手写堆

优先队列

5 3
1 2 3 4 5
4 2 1
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 9;
​
priority_queue<ll>pq;
int main()
{
    ios::sync_with_stdio, cin.tie(0), cout.tie(0);
    int n, q; cin >> n >> q;
    ll sum = 0;
    for (int i = 1; i <= n; i++){
        ll x; cin >> x;
        sum += x;
        pq.push(x);
    }
    for (int i = 1; i <= q; ++i){
        ll x; cin >> x;
        while (pq.top() >= x){
            ll y = pq.top(); pq.pop();
            sum += y%x - y;
            pq.push(y%x);
        }
        cout << sum << " ";
    }
    return 0;
}

手写一个堆