1.知识点:
①https://www.cnblogs.com/WindSun/p/11444446.html
②https://blog.csdn.net/fnzsjt/article/details/40118365
2.运用:
①https://blog.csdn.net/u013317445/article/details/89680330?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromBaidu-1.control&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromBaidu-1.control
②https://xiaoneng.blog.csdn.net/article/details/103206628?utm_medium=distribute.pc_relevant_t0.none-task-blog-BlogCommendFromBaidu-1.control&depth_1-utm_source=distribute.pc_relevant_t0.none-task-blog-BlogCommendFromBaidu-1.control
3.例子:
①思路:
先用一个最小堆存message的优先级,再定义一个map容器存message和优先级。当读取到GET时,取出最小堆顶,然后在map中输出这个堆顶为关键字的value即message
②代码:
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
map<int,string> Messages;//用来存储message和优先级
int main()
{
vector<int> min;//最小堆底层容器
int t;
string flag;
cin>>t;
while(t--){
cin>>flag;
if(flag=="PUT"){
string message;
int rank;
cin>>message>>rank;
min.push_back(rank);//在vector的末尾插入元素rank
Messages[rank]=message;
push_heap(min.begin(),min.end(), greater<int>());//push_head函数先是让end迭代器+1(因为vector多了一个元素),然后执行sifedown通过下溯维护最小堆
}
if(flag=="GET"){
if(min.size()==0)
{
cout<<"EMPTY QUEUE!"<<endl;
}
else{
int number=min[0];
pop_heap(min.begin(),min.end(), greater<int>());//pop_heap把堆顶元素取出来,放到了ector容器的末尾,用原来的末尾元素去替代,然后end迭代器减1,执行siftdown()下溯函数来重新调整堆,此时不会算上末尾的那个元素,因为end减一了
min.pop_back();//这在底层vector数据容器中删除最后一个元素,即上一步提出来的首元素
cout<<Messages[number]<<endl;
}
}
}
return 0;
}