c_cpp 堆。空手。

Posted 2021-05-14

#include<cstdio>
#include<utility>
#include<algorithm>
using namespace std;

struct P { int d; int s; int p; };

int n;
P x[1000020];
P* y[1000020];

void myswap(P*& a, P*& b) {
    swap(a->p, b->p);
    swap(a, b);
}

bool lt(int i, int j) {
    if (y[i]->s < y[j]->s) return true;
    else if (y[i]->s != y[j]->s) return false;
    return y[i]->d > y[j]->d;
}

void up(int idx) {
    while (idx / 2 > 0 && lt(idx / 2, idx)) {
        myswap(y[idx / 2], y[idx]);
        idx /= 2;
    }
}

void down() {
    int idx = 1;
    while (idx * 2 + 1 <= n) {
        if (lt(idx, idx * 2) && lt(idx * 2 + 1, idx * 2)) {
            myswap(y[idx], y[idx * 2]);
            idx = idx * 2;
        } else if (lt(idx, idx * 2 + 1)) {
            myswap(y[idx], y[idx * 2 + 1]);
            idx = idx * 2 + 1;
        } else break;
    }
    if (idx * 2 == n && lt(idx, idx * 2))
        myswap(y[idx], y[idx * 2]);
}

int main() {
    int q, h, p;
    scanf("%d%d", &n, &q);

    for (int i = 1; i <= n; i++) {
        x[i].d = i;
        x[i].p = i;
        x[i].s = 0;
        y[i] = &x[i];
    }

    while (q--) {
        scanf("%d", &h);
        if (h == 1) {
            scanf("%d%d", &h, &p);
            x[h].s += p;
            up(x[h].p);
        } else {
            scanf("%d", &h);
            y[1]->s -= h;
            down();
        }
    }

    for (int i = 1; i <= n; i++)
        printf("%d\n", x[i].s);
}