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 vote183 views1 answer
C++ overloading by ref-qualifiers
C++
1 vote206 views1 answer
G++ -wall option meaning
C++
3 votes200 views3 answers
Class cpp
C++
0 vote169 views1 answer
Run c++ files on chrome book
C++
1 vote177 views1 answer
C++ code for bubble sort
C++
0 vote174 views1 answer
How to create a c++ templeate
C++
8 votes230 views6 answers
C++ while loop
C++
5 votes193 views1 answer
Break in c++
C++
3 votes209 views2 answers
Last element of a set in c++
C++
18 votes184 views5 answers
How to clear console c++
C++