P3378 【模板】堆 ( 手写 / stl )

题目链接：点击进入

题目

思路 ( 手写堆 )

手写最小堆。

插入 x ：将 x 插入到最后一个节点处，将 x 不断与它的父节点比较，x 比父节点小就 swap 上浮一下，继续比较，否则就 break 结束。

删除：删掉第一个点，将最后一个节点 x 放在第一个节点上，节点数-- ，然后将 x 不断与它的两个孩子中小的那个比较，x 比小的孩子大就 swap 下沉一下，继续比较，否则 break 结束

输出最小值：第一个节点 ( 堆顶 ) 的值就是最小值。

代码 ( 手写堆 )

// Problem: P3378 【模板】堆
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3378
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define base 233 
#define pb push_back
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
    int k = 0, f = 1 ;
    char c = getchar() ;
    while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
    while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
    return k * f ;
}
/*--------------------------------------------*/

int t,a[maxn],cnt;

void insert(int x)
{
	a[++cnt]=x;
	int pos=cnt;
	while(pos)
	{
		int fa=pos/2;
		if(a[fa]>a[pos]) swap(a[fa],a[pos]);
		else break;
		pos=fa;
	}
}
void del()
{
	swap(a[cnt],a[1]);
	cnt--;
	int pos=1;
	while((pos*2)<=cnt)
	{
		int ch=pos*2;
		if(ch+1<=cnt&&a[ch]>a[ch+1]) ch++;
		if(a[pos]>a[ch]) swap(a[pos],a[ch]);
		else break;
		pos=ch;
	}
}

int main() 
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);cout.tie(0);	
	cin>>t;
	while(t--)
	{
		int op,x;
		cin>>op;
		if(op==1)
		{
			cin>>x;
			insert(x);
		}
		else if(op==2)
			cout<<a[1]<<endl;
		else if(op==3)
			del();
	}
    return 0;
} 

思路 ( stl 优先队列 )

//升序队列，小顶堆
priority_queue < int , vector < int > , greater < int > > q;
//降序队列，大顶堆
priority_queue < int , vector < int > , less < int > >q;

代码 ( stl )

// Problem: P3378 【模板】堆
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P3378
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define base 233 
#define pb push_back
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
    int k = 0, f = 1 ;
    char c = getchar() ;
    while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
    while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
    return k * f ;
}
/*--------------------------------------------*/

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

int main() 
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);cout.tie(0);	
	cin>>t;
	while(t--)
	{
		int op,x;
		cin>>op;
		if(op==1)
		{
			cin>>x;
			q.push(x);
		}
		else if(op==2)
			cout<<q.top()<<endl;
		else if(op==3)
			q.pop();
	}
    return 0;
}