Heap STL implementation

#include <iostream>

#include <queue>

using namespace std;

//type def pair<int , pair<int , int >> ppi; U can replace the int written below with ppi if the value store is in pair form

int main() {

priority_queue<int> maxh; //Max-Heap declaration

priority_queue<int, vector<int>, greater<int>> minh; //Min-Heap declaration

}