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

-1 vote316 views1 answer
#include
C++
-1 vote377 views1 answer
Templates of templates c++
C++
0 vote328 views1 answer
How to read rotary encoder c++
C++
0 vote348 views1 answer
Sort vector of pair c++
C++
0 vote415 views1 answer
Play audio c++
C++
0 vote334 views1 answer
Ampersand in cpp
C++
3 votes362 views4 answers
C++ get last character of string
C++
0 vote334 views1 answer
C++ program to convert kelvin to celsius
C++
0 vote376 views1 answer
Uint8_t in c++
C++
2 votes357 views1 answer
C++ custom compare in set
C++