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

3 votes347 views1 answer
Extends c++
C++
22 votes293 views18 answers
Pointers in c++
C++
2 votes291 views3 answers
Selection sort cpp
C++
3 votes327 views2 answers
Prints out the elements in the array c++
C++
2 votes319 views2 answers
C++ int to qstring
C++
11 votes305 views3 answers
Count occurrences of character in string c++
C++
2 votes296 views1 answer
C++ get filename from path
C++
0 vote358 views1 answer
Convert unsigned long to string c++
C++
0 vote310 views1 answer
Use uint in c++
C++
0 vote313 views1 answer
Youtube to facebook link converter
C++