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

3 votes99 views2 answers
C++ read text file
C++
0 vote159 views1 answer
Unordered_map header file c++
C++
1 vote174 views1 answer
How to round to nearest whole number unity
C++
0 vote193 views1 answer
C++ get maximum value unsigned int
C++
3 votes153 views2 answers
Print type c++
C++
4 votes155 views1 answer
Index from iterator c++
C++
1 vote150 views1 answer
Find largest number in vector c++
C++
1 vote146 views1 answer
Get first element of tuple c++
C++
-1 vote154 views1 answer
Istream c++
C++
5 votes156 views3 answers
Remove space in string c++
C++