结构体的stl优先级队列-priority_queue用法

利用cmp函数和priority_quue实现存储结构体的最小堆

// 结构体的 stl 优先级队列
#include <stdio.h>
#include <vector>
#include <queue>

struct Qitem{
    int x;
    int y;
    int h;
    Qitem(int _x, int _y, int _h): x(_x), y(_y), h(_h){}
};

struct cmp{
    bool operator() (const Qitem &a, const Qitem &b){
        return a.h > b.h;  // '>' 是最小堆
    }
};

int main(){
    std::priority_queue <Qitem, std::vector<Qitem>, cmp> Q;
    Q.push(Qitem(0, 0, 5));
    Q.push(Qitem(1, 3, 2));
    Q.push(Qitem(5, 2, 4));
    Q.push(Qitem(0, 1, 8));
    Q.push(Qitem(6, 7, 1));
    while(!Q.empty()){
        int x = Q.top().x;
        int y = Q.top().y;
        int h = Q.top().h;
        printf("x = %d, y = %d, z = %d\n", x, y, h);
        Q.pop();
    }
    return 0;
}