(119). 31.3. HEAP STL - anishsingh90/Data_Structure_And_Algorithm_In_Cpp_github.io GitHub Wiki
#include <bits/stdc++.h> using namespace std;
int main(){ priority_queue<int, vector > pq; pq.push(2); pq.push(3); pq.push(1); cout << pq.top() << endl; // print = 3
pq.pop();
cout << pq.top() << endl; // print = 2
cout << endl;
priority_queue<int, vector<int>, greater<int> > pqm;
pqm.push(2);
pqm.push(1);
pqm.push(3);
cout << pqm.top() << endl; // print = 1
pqm.pop();
cout << pqm.top() << endl; // print = 2
return 0;
}
/* OUTPUT: 3 2
1 2 */