优先队列priority_queue用法

 

1、基本类型

#pragma warning(disable:4786)

#include <iostream>
#include<queue>
#include<vector>
#include<stdio.h>
using namespace std;

struct myComp
{
    //STL中默认的是最大优先队列
    bool operator () (const int &a,const int &b)
    {
        return a>b;//最小堆
    }
};

int main()
{
    priority_queue<int,vector<int>,myComp>pq;
    pq.push(1);
    pq.push(2);
    pq.push(3);
    pq.push(9);
    while(pq.empty()!=true)
    {
        cout<<pq.top()<<" ";
        pq.pop();
    }
    cout<<endl;
    return 0;
}
/*
1 2 3 9
Press any key to continue

*/

2、结构体

//小堆

struct node
{
    int time,Q_num;
};
struct cmp
{
    bool operator()(const node& a,const node& b)
    {
        if(a.time!=b.time) return a.time>b.time;
        else return a.Q_num>b.Q_num;
    }
};
priority_queue<node,vector<node>,cmp> task;

struct Stone{
 int x; //石头的初始地
 int y; //石头能扔的最远距离
 };
 booloperator<( Stone a, Stone b )
 { //重载小于，按照结构体中x小的在队顶，如果x一样，则按照y的最小的在//

队顶
 if( a.x== b.x ) return a.y > b.y;
 return a.x > b.x;
 }

 priority_queue<Stone>que; //定义一个Stone成员的优先//队列