希望更丰富的展现？使用Markdown
by 弦巻こころ @ 2018-10-22 13:55:29
```cpp
#include<iostream>
using namespace std;
int heap[1000007];
int n;
int heap_size;
void swap(int a,int b)
{
int tmp;
tmp=a;
a=b;
b=tmp;
}
void add(int a)
{
heap[++heap_size]=a;
int now=heap_size,next;
while(now>1)
{
next=now>>1;
if(heap[now]>=heap[next]) return;
swap(heap[now],heap[next]);
now=next;
}
}
void del()
{
int now=1,next;
heap[1]=heap[heap_size--];
while(now*2<=heap_size)
{
next=now*2;
if(next<heap_size&&heap[next+1]<heap[next]) next++;
if(heap[next]>=heap[now]) break;
swap(heap[next],heap[now]);
now=next;
}
}
int main()
{
int x;
cin>>n;
//heap_size=n;
int num;
for(int i=1;i<=n;i++)
{
cin>>x;
if(x==1)
{
cin>>num;
add(num);
}
if(x==2)
{
cout<<heap[1]<<endl;
}
if(x==3)
{
del();
}
}
return 0;
}
```
by Msaikoto @ 2018-10-22 13:55:41
事实证明，priority_queue还是很好用的
by Everlasting_Snow @ 2018-10-22 13:57:36
```
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
STL大法好
```
by lqhsr @ 2018-10-22 13:59:38
@[Msaikoto](/space/show?uid=100331)
```cpp
#include <bits/stdc++.h>
#define il inline
using namespace std;
il int init() {
priority_queue<int, vector<int>, greater<int> > heap;
int n, c, x;
scanf("%d", &n);
for(register int i = 1; i <= n; i++) {
scanf("%d", &c);
if(c == 1) {
scanf("%d", &x);
heap.push(x);//插入
}
else if(c == 2) {
printf("%d\n", heap.top());//输出堆顶元素
}
else {
heap.pop();//删除堆顶元素
}
}
return 0;
}
int main() {
init();
return 0;
}
```
by 越学越掂 @ 2018-10-22 14:01:37
您的swap很有想法
by sigland @ 2018-10-22 14:12:17
您swap了个啥啊?
by King_of_gamers @ 2018-10-22 14:21:42
Orz
by Everlasting_Snow @ 2018-10-22 14:21:50
@[越学越掂](/space/show?uid=38886) 谢谢，找到问题了，swap没有加&
by Msaikoto @ 2018-10-23 12:37:42
@[炜哥](/space/show?uid=28810) 谢谢
by Msaikoto @ 2018-10-23 12:37:56