Priority queue c++ type of pairs

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
// main program
int main() {
   priority_queue<pi, vector<pi>, greater<pi> > pq;
   pq.push(make_pair(10, 200));
   pq.push(make_pair(20, 100));
   pq.push(make_pair(15, 400));
   pair<int, int> top = pq.top();
   cout << top.first << " " << top.second;
   return 0;
}

Source: tutorialspoint.com

Similar codes

0 vote316 views1 answer
Waiting in a serial as the spool reflect the queue operation. Demonstrate Printer Behavior in context of Queue.Subject to the Scenario implement the Pop and Push Using C++.
C++
1 vote370 views1 answer
Gfg cyclic array rotation
C++
0 vote318 views1 answer
Initialisation of a c++ variable
C++
0 vote330 views1 answer
C++counter
C++
0 vote340 views1 answer
Stream Overloading
C++
0 vote308 views1 answer
How to use comparitor in priority queu in c++
C++
0 vote362 views1 answer
Array must be initialized with a brace-enclosed initializer
C++
0 vote290 views1 answer
Converting a for loop to a while loop C++
C++
0 vote318 views1 answer
Cpp array init value
C++
1 vote342 views1 answer
Array sum in c++ stl
C++