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 vote198 views1 answer
& in xml
C++
0 vote216 views1 answer
Vprintf
C++
0 vote222 views1 answer
C++ overloading by ref-qualifiers
C++
7 votes194 views6 answers
Iterate through map
C++
0 vote198 views1 answer
Powershell get uptime remote computer
C++
9 votes195 views4 answers
Print vector c++
C++
-1 vote203 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
0 vote195 views1 answer
Qt asynchronous HTTP request
C++
1 vote200 views1 answer
C++ std::string find and replace
C++
0 vote214 views1 answer
How to read wav file in C++
C++