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

4 votes243 views1 answer
Deep copy c++
C++
3 votes242 views4 answers
String c++
C++
7 votes298 views5 answers
Stoi cpp
C++
6 votes230 views2 answers
How to print double value up to 9 decimal places in c++
C++
4 votes222 views1 answer
Cpp iterator of element
C++
0 vote224 views1 answer
How to manually start windows app
C++
2 votes233 views1 answer
Check gpu usage jetson nano
C++
0 vote241 views1 answer
Write a C++ program to Computing Mean and Median Using Arrays
C++
0 vote232 views3 answers
C to c++ online converter
C++
15 votes230 views2 answers
Calculate factorial
C++