堆应用模板

堆

手写堆上浮建堆

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 1000000;
int a[N];
int n,cnt;

void up(int u) {
	int v = u >> 1;
	if (v && a[v] > a[u])
		swap(a[u], a[v]), up(v);
}

void dw(int u) {
	int v = u, t = u << 1;
	if (t <= cnt && a[t] < a[v]) v = t;
	if (t + 1 <= cnt && a[t + 1] < a[v]) v = t + 1;
	if (u != v) swap(a[u], a[v]), dw(v);
}

void push(int x) {
	a[++cnt] = x;
	up(cnt);
}

void pop() {
	a[1] = a[cnt--];
	dw(1);
}

int main() {
	cin >> n;
	for (int i = 1, x; i <= n; i++) {
		cin >> x, push(x);//上浮建堆
	}
	for (int i = 1; i <= n; i++) {
		cout << a[1], pop();
	}
	return 0;
}

手写堆下沉建堆

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 1000000;
int n, cnt;
int a[N];

void up(int u) {
	int v = u >> 1;
	if (v && a[v] > a[u])
		swap(a[v], a[u]), up(v);
}
void dw(int u) {
	int v = u, t = u << 1;
	if (t <= cnt && a[t] < a[v]) v = t;
	if (t + 1 <= cnt && a[t + 1] < a[v]) v = t + 1;
	if (v != u) swap(a[v],a[u]),dw(v);
}


void push(int x) {
	a[++cnt] = x;
	up(cnt);
}
void pop() {
	a[1] = a[cnt--];
	dw(1);
}

int main() {
	scanf("%d", &n);
	cnt = n;
	for (int i = 1, x; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	for (int i = n >> 1; i; i--) dw(i);
	for (int i = 1; i <= n; i++) {
		printf("%d",a[1]),pop();
	}
	return 0;
}

STL堆应用

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;

priority_queue<int, vector<int>, greater<int> > q;

int main() {
    int n; scanf("%d", &n);
    for (int i = 1, x; i <= n; i++)
        scanf("%d", &x), q.push(x); //建堆

    for (int i = 1; i <= n; i++)
        printf("%d ", q.top()), q.pop();
}