Priority Queue

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


int main(){
    priority_queue<int> pq;

    pq.push(8);
    pq.push(2);
    pq.push(13);

    cout<<pq.top()<<endl; //13

    pq.pop();

    cout<<pq.top()<<endl; //8

    priority_queue<int, vector<int> , greater<int> > min_pq;

    min_pq.push(8);
    min_pq.push(2);
    min_pq.push(13);

    cout<<min_pq.top()<<endl;

    priority_queue< pair<int,int> > pair_pq;

    pair_pq.push({8, 100});

    pair_pq.push({1,500});

    pair_pq.push({13,90});

    cout<<pair_pq.top().first<<endl;


}