heap_stl_priority_queue.cpp

#include<bits/stdc++.h>
using namespace std;

#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i=a; i<b; i++)
#define ff first
#define ss second
#define setBits(x) builtin_popcount(x)

int main() {

    // declaring a maxheap
    priority_queue<int, vector<int>> pq;
    pq.push(2);
    pq.push(3);
    pq.push(1);

    cout<<"for maxheap :"<<endl;
    cout<<pq.top()<<endl;
    pq.pop();
    cout<<pq.top()<<endl;

    // declaring a minheap
    priority_queue<int, vector<int>, greater<int>> pqm;
    pqm.push(2);
    pqm.push(1);
    pqm.push(3);

    cout<<"for minheap :"<<endl;
    cout<<pqm.top()<<endl;
    pqm.pop();
    cout<<pqm.top()<<endl;

    return 0;
}