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

66 votes441 views8 answers
Dogecoin price
C++
0 vote372 views1 answer
Int and char in c++ compiler
C++
0 vote392 views1 answer
Use declaration to define a variable
C++
0 vote360 views1 answer
Sprintf add two xeroes for a float number
C++
19 votes344 views5 answers
When kotlin
C++
0 vote302 views10 answers
Convert java code to c++ online
C++
-2 votes399 views1 answer
C++ press any key
C++
1 vote339 views2 answers
C++ Split String By Space into Vector
C++
0 vote348 views1 answer
Vector of vectors of pairs c++
C++
0 vote349 views5 answers
Return tuple or null
C++