Heaps using C++ STL

heaps.cpp

// max heap
priority_queue <ll> max_heap; // by defualt priority_queue is maxheap always.

// min heap
priority_queue <ll, vector<ll>, greater<ll> > min_heap;

//  type, container, comparator function

typedef struct mystruct {
  ll one;
  ll two;
  bool operator < (const mystruct t) const {
      one < t.one;
  }
}mystruct;

priority_queue <mystruct> heapofStruct;