min heap in c++

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

// C++ program to use priority_queue to implement min heap 
#include <bits/stdc++.h> 
using namespace std; 
  
// Driver code 
int main () 
{ 
    // Creates a min heap 
    priority_queue <int, vector<int>, greater<int> > pq; 
    pq.push(5); 
    pq.push(1); 
    pq.push(10); 
    pq.push(30); 
    pq.push(20); 
  
    // One by one extract items from min heap 
    while (pq.empty() == false) 
    { 
        cout << pq.top() << " "; 
        pq.pop(); 
    } 
  
    return 0; 
} 

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

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