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 vote157 views1 answer
Fractional Knapsack problem
C++
1 vote148 views1 answer
Separation between paragraphs latex
C++
0 vote170 views2 answers
Check prime cpp gfg
C++
0 vote181 views1 answer
Define a type in c++
C++
3 votes166 views2 answers
C++ vector element search
C++
-1 vote159 views1 answer
Un aliment traduction espagnol
C++
0 vote150 views1 answer
Move assignment operator c++
C++
1 vote167 views10 answers
Js
C++
5 votes186 views2 answers
Return multiple values c++
C++
7 votes164 views6 answers
Sleep in c++
C++