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 vote288 views1 answer
Can derived class access base class non-static members without object of the base class
C++
0 vote273 views1 answer
C++ split string by several space
C++
36 votes258 views2 answers
Range of long long in c++
C++
0 vote289 views1 answer
C++ sum a vector of digits
C++
0 vote294 views1 answer
Split text c++
C++
0 vote275 views1 answer
How to slice vector in c++
C++
0 vote227 views1 answer
Electricity billing system project in c++
C++
1 vote222 views1 answer
How to fill all of the array in c++
C++
1 vote263 views1 answer
Float in c++
C++
1 vote269 views3 answers
('Failed to import pydot. You must `pip install pydot` and install graphviz (https://graphviz.gitlab.io/download/), ', 'for `pydotprint` to work.')
C++