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
Q10
C++
1 vote133 views1 answer
Iterate vector from end to begin
C++
0 vote130 views1 answer
Sort vector of pair c++
C++
1 vote164 views1 answer
C++ cout format
C++
0 vote169 views1 answer
Unary overload operator cpp
C++
10 votes155 views3 answers
C++ check if file exits
C++
1 vote146 views3 answers
Right shift in c++
C++
9 votes178 views2 answers
Sort vector in reverse order c++
C++
0 vote130 views1 answer
Get input for array of unknown length/size in c++
C++
0 vote161 views1 answer
C++ generate a random letter
C++