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

39 votes259 views6 answers
C++ print hello world
C++
0 vote241 views1 answer
Unreal ensureMsgf example
C++
2 votes175 views1 answer
Hwo to calculate the number of digits using log in c++
C++
0 vote189 views1 answer
Are maps sorted c++
C++
1 vote176 views1 answer
Case label in c++
C++
0 vote188 views1 answer
Add comment in c/c++
C++
0 vote228 views1 answer
Codeforces Pangram in c++
C++
0 vote215 views1 answer
Iterate over map c++17
C++
0 vote223 views1 answer
Time_t c++ stack overflow
C++
2 votes185 views2 answers
Cpp #include "" <>
C++