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 vote298 views1 answer
Dfs program in c++
C++
0 vote275 views1 answer
Crypto npm random bytes
C++
4 votes275 views2 answers
Max value of double c++
C++
42 votes336 views10 answers
Twitter
C++
1 vote259 views1 answer
How to run a c++ program in the background
C++
0 vote299 views1 answer
Convert all strings in vector to lowercase or uppercase c++
C++
3 votes246 views1 answer
(a) one-dimensional arrays and multidimensional arrays in c++
C++
20 votes317 views3 answers
How to append to a vector c++
C++
0 vote269 views1 answer
C++ erase last element of set
C++
1 vote322 views1 answer
What does the modularity mean in c++
C++