优先队列
头文件#include<queue>
函数:push()进队,
pop()出队,
size()返回元素个数,
top()返回最高优先级的元素,
empty()队是否为空
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
struct node{
int x;
int y;
friend bool operator < (node a, node b)
{
return a.x > b.x;//结构体中,x小的优先级高
}
};
int main()
{
//priority_queue<int,vector<int>, greater<int> > q; 从小到大pop
//priority_queue<int> q;从大到小pop
priority_queue<node> q;
int n,a,w;
node nod;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&nod.x);
scanf("%d",&nod.y);
q.push(nod);
}
printf("%4d%4d",q.top().x,q.top().y);//输出节点中x最小的结点信息
q.pop();
return 0;
}