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 vote248 views1 answer
C++ text between substrings
C++
0 vote229 views1 answer
How to move your chrector in unity
C++
0 vote262 views1 answer
How to create a c++ templeate
C++
1 vote236 views2 answers
C++ example
C++
0 vote216 views1 answer
C++ while loop decrement
C++
0 vote285 views1 answer
Get bitshift to wrap c++
C++
1 vote215 views1 answer
Whole size of the internet
C++
1 vote257 views1 answer
Get current date in c++
C++
0 vote242 views1 answer
C++ over load oprator to print variable of clas
C++
0 vote240 views1 answer
How can I replace a pattern from string in c++
C++