堆（模板）

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 1000005;

int heap[N];
int n;

void up(int p)
{
	while (p > 1)
	{
		if (heap[p/2] > heap[p]) swap(heap[p/2], heap[p]);
		else break;
		p /= 2;
	}
}

void down(int p)
{
	int s = p*2;
	while (s <= n)
	{
		if (heap[s+1] < heap[s]) s++;
		if (heap[p] > heap[s]) swap(heap[p], heap[s]);
		else break;
		p = s;
		s = p*2;
	}
}

void Push(int x)
{
	heap[++n] = x;
	up(n);
}

void remove(int p)//删除heap中下标为p的 
{
	heap[p] = heap[n--];
	up(p);
	down(p);
}

void Pop()
{
	/*
	heap[1] = heap[n--];
	down(1);
	*/
	remove(1);
}

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

int main()
{
	int q, d, x;
	scanf("%d", &q);
	while (q--)
	{
		scanf("%d", &d);
		if (d == 1)
		{
			scanf("%d", &x);
			Push(x);
		}
		else if (d == 2) printf("%d\n", Top());
		else Pop();
	}
	return 0;
}