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 vote153 views1 answer
FlipperRSocketResponder.cpp command failed react native
C++
2 votes161 views2 answers
Back() in c++
C++
1 vote198 views1 answer
C++ delete directory
C++
1 vote163 views1 answer
C++ remove n characters from string
C++
0 vote162 views1 answer
Gcc suppress warning inline
C++
0 vote159 views3 answers
Hwo to send token on redirection in passport
C++
0 vote179 views1 answer
Free pair c++
C++
-1 vote172 views1 answer
How to write hello world c++
C++
1 vote191 views1 answer
What are specialized classes c++
C++
0 vote160 views1 answer
Mpgh dbd
C++