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 vote279 views1 answer
How to do if command in c++
C++
31 votes264 views1 answer
When to use struct vs class c++
C++
0 vote275 views1 answer
Why the << operator is friend
C++
2 votes324 views1 answer
What language is ethereum written in
C++
0 vote306 views1 answer
Bitwise operator in C++ example programs
C++
4 votes269 views1 answer
Cin statement c++
C++
-1 vote268 views1 answer
What does for do in c++
C++
0 vote315 views1 answer
Patrick and Shopping codeforces in c++
C++
0 vote282 views1 answer
Check if char are equal c++
C++
0 vote294 views1 answer
Remove digit from number c++
C++