priority_queue<queue_type> queue_name

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

// declaring a struct class for the Priority Queue
struct PQ  {
   multiset<int> s;

   //Getting the size of the Queue
   int size() { 
      return s.size(); 
   }

   //Checking Queue is empty or not
   bool isEmpty() { 
      return (s.size() == 0); 
   }

   void insert(int i) { 
      s.insert(i); 
   }

   //Method to get the smallest element of the Queue
   int getMin() { 
      return *(s.begin()); 
   }

   // Method to get the largest Queue element
   int getMax() { 
      return *(s.rbegin()); 
   }

   // Deleting Queue elements
   void deleteMin() {
      if (s.size() == 0)
         return;

      auto i = s.begin();
      s.erase(i);
   }

   // Method to delete the largest element
   void deleteMax() {
      if (s.size() == 0)
      return;

      auto i = s.end();
      i--;
      s.erase(i);
   }
};

//Main code
int main() {
   PQ p;   //initializing the Priority Queue

//inserting Queue elements
   p.insert(20);      
   p.insert(30);
   p.insert(50);
   p.insert(60);
   p.insert(90);

   cout << "Smallest Element is: " << p.getMin() << endl;
   cout << "Largest Element is: " << p.getMax() << endl;

   p.deleteMin();
   cout << "Smallest Element is: " << p.getMin() << endl;

   p.deleteMax();
   cout << "Largest Element is: " << p.getMax() << endl;

   cout << "Size of the Queue is: " << p.size() << endl;

   cout << "Queue is empty?: "
   << (p.isEmpty() ? "YES" : "NO") << endl;

   return 0;
}

Smallest Element is: 20
Largest Element is: 90
Smallest Element is: 30
Largest Element is: 50
Queue is Empty?: NO