min priority queue c 2b 2b

1priority_queue <int, vector<int>, greater<int>> g ;

1priority_queue <int, vector<int>, greater<int>> minHeap;

1#include<queue>
2std::priority_queue <int, std::vector<int>, std::greater<int> > minHeap; 

1#include <bits/stdc++.h>
2using namespace std;
3 
4
5int main ()
6{
7   
8    priority_queue <int> pq;
9    pq.push(5);
10    pq.push(1);
11    pq.push(10);
12    pq.push(30);
13    pq.push(20);
14 
15   
16    while (pq.empty() == false)
17    {
18        cout << pq.top() << " ";
19        pq.pop();
20    }
21 
22    return 0;
23}