使用cpp的优先队列

// implementing maxheap and min heap using priority queue

#include <iostream>
#include "queue"
#include "vector"
using namespace std;

class Mountain{
public:
    string name;
    int height;
public:
    Mountain(string arg_name, int arg_height):name(arg_name),height(arg_height){}

};

class CompareGreaterName{
public:
    bool operator()(const Mountain& a, const Mountain& b) const{
        // Mountain with smaller name goes below
        if (a.name.size()<b.name.size()) return true;
        return false;
    }
};


int main() {
    priority_queue<Mountain,vector<Mountain>,CompareGreaterName> pq_mountains;
    Mountain m1("K2",8611);
    Mountain m2("Kangchenjunga", 8586);
    Mountain m3("Everest", 8848);
    Mountain m4("Annapurna", 8091);

    pq_mountains.push(m1);
    pq_mountains.push(m2);
    pq_mountains.push(m3);
    pq_mountains.push(m4);

    cout<<"Arranging mountain name(s) based on the length (max_heap) of the names"<<endl;
    while(!pq_mountains.empty()){ // 按名字的长度排序
        Mountain mount = pq_mountains.top();
        pq_mountains.pop();
        cout<<mount.name<<" "<<mount.height<<endl;
    }

    priority_queue<int,vector<int>> pq_maxheap; // 最大堆
    pq_maxheap.push(5);
    pq_maxheap.push(2);
    pq_maxheap.push(7);
    pq_maxheap.push(13);
    pq_maxheap.push(11);
    cout<<"Elements in max heap:";
    while (!pq_maxheap.empty()){
        cout<<pq_maxheap.top()<<" ";
        pq_maxheap.pop();
    }

    priority_queue<int,vector<int>,greater<int>> pq_minheap; // 最小堆
    pq_minheap.push(5);
    pq_minheap.push(2);
    pq_minheap.push(7);
    pq_minheap.push(13);
    pq_minheap.push(11);
    cout<<"\nElements in min heap:";
    while (!pq_minheap.empty()){
        cout<<pq_minheap.top()<<" ";
        pq_minheap.pop();
    }

    return 0;
}

输出：

Kangchenjunga 8586
Annapurna 8091
Everest 8848
K2 8611
Elements in max heap:13 11 7 5 2
Elements in min heap:2 5 7 11 13