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 vote173 views1 answer
Ampersand in cpp
C++
6 votes147 views2 answers
Index string c++
C++
0 vote208 views1 answer
Electricity billing system project in c++
C++
0 vote183 views1 answer
C++ asio read full socket data into buffer
C++
0 vote126 views1 answer
Identity
C++
0 vote168 views1 answer
C++ program to find gcd of 3 numbers
C++
0 vote176 views1 answer
Convert characters to lowercase c++
C++
0 vote163 views1 answer
C++ pass char array by reference
C++
2 votes221 views1 answer
Cin.tie c++
C++
14 votes130 views6 answers
Cout c++
C++