Answers for "top priority queue in c++"

priority queue in c++

//Shubh'grepper
// Implementation of priority_queue in c++

//queue with elements in decreasing order
priority_queue<int> pq;

// queue with elements in increasing order  using compare function inside declaration
priority_queue <int, vector<int>, greater<int> > pq;

//priority_queue of type pair<int, int>
#define pp pair<int, int>
priority_queue <pp, vector<pp>, greater<pp> > pq;

C++ accessing in priority queue

/* Program to access an element of highest priority */
 
#include<iostream>
#include<queue>     //Header-file for queue
using namespace std;
 
 
int main()
{
priority_queue<int> p1;
p1.push(35);    
p1.push(40);
p1.push(95);
p1.push(25);
  
cout<<p1.top();      //fetch element of highest
priority(maximum element) i.e 95
}