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 vote185 views1 answer
Modulo subtraction
C++
0 vote199 views1 answer
Std vector c++
C++
1 vote197 views1 answer
Regex for phone number c++
C++
0 vote185 views1 answer
C++ remove all elements equal to
C++
0 vote171 views1 answer
C++ calorie calculator using a for loop
C++
1 vote211 views3 answers
Comment in c++
C++
0 vote233 views1 answer
Tabeau pseudo dynamique sur c++
C++
2 votes216 views1 answer
Ue4 cpp OnHit
C++
0 vote199 views1 answer
High school hacking competition
C++
-1 vote192 views4 answers
Convert c++ to c online
C++