二叉堆【小顶堆】数组模板+C++STL

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int SIZE = 1e6;
int heap[SIZE], n;


void up(int p) {
	while(p > 1) {

		if(heap[p] < heap[p/2]) {
			swap(heap[p], heap[p/2]);
			p /= 2;
		}
		else break;
	}
}

void Insert(int val) {
	heap[++n] = val;
	up(n);
}

int GetTop() {
	return heap[1];
}

void down(int p) {
	int s = p * 2;
	while(s <= n) {
		if(heap[s] > heap[s+1] && s < n) s++;
		if(heap[s] < heap[p]){
			swap(heap[s], heap[p]);
			p = s, s = p * 2;
		}
		else break;
	}
}
void ExTract() {
	heap[1] = heap[n--];
	down(1);
}
void remove(int k) {
	heap[k] = heap[n--];
	up(k), down(k);
}
int main() {
	int t;
	cin >> t;
	for(int i = 0; i < t; ++ i) {
	    int a;
	    cin >> a;
	    Insert(a);
	}
	return 0;
}

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