#include<iostream>
#include<vector>

using namespace std;

class PriorityQueue{
  vector<int> pq;
  public:
      PriorityQueue(){
      
      }
      bool isEmpty(){
          return pq.size()==0 ;
      }
      
      /// Return size of priority queue - no of elements present
      int getSize(){
         return pq.size();
      }
      
      int getMin(){
         if(isEmpty){
            return 0;  /// pq is empty
         }
         return pq[0];
      }
      
      void insert(int element){
         pq.push_back(element);   /// CBT yes, Heap not
         
         int cI = pq.size() - 1;
         while(cI > 0){
            int pI = (cI-1)/2;
            if(pq[cI] < pq[pI]){
                swap(pq[cI], pq[pI]);
                cI = pI;
            }else {
               break;
            }
         }
      }
};
int main(){

   return 0;
}