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 vote142 views1 answer
C++ capture screen as pixel array
C++
0 vote323 views1 answer
Why ostream cannot be constant
C++
0 vote169 views1 answer
How to run a msi file raspbrain
C++
0 vote147 views1 answer
10^18 data type in c++
C++
0 vote164 views1 answer
Imports the elements in the array c++
C++
0 vote160 views1 answer
Nodeafternode
C++
4 votes137 views1 answer
C++ get nth character in string
C++
0 vote140 views1 answer
Double array size c++
C++
2 votes142 views1 answer
Sfml draw tex
C++
1 vote145 views1 answer
Insert binary search tree
C++