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 vote169 views1 answer
Automatic legend matlab
C++
0 vote217 views1 answer
How to analyse a poem
C++
-1 vote163 views1 answer
Int to hexadecimal in c++
C++
2 votes165 views1 answer
For loop reverse C++
C++
0 vote172 views1 answer
Std::gcd
C++
29 votes174 views10 answers
Hello world c++
C++
1 vote214 views3 answers
('Failed to import pydot. You must `pip install pydot` and install graphviz (https://graphviz.gitlab.io/download/), ', 'for `pydotprint` to work.')
C++
9 votes129 views1 answer
C++ read file to string
C++
0 vote178 views1 answer
Std::cout and cout
C++
0 vote193 views1 answer
C++ optimize big int array
C++