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 vote311 views1 answer
Eosio get time
C++
0 vote321 views1 answer
<< in c++
C++
2 votes308 views3 answers
Online ide c++
C++
0 vote293 views1 answer
Nested conditional operator
C++
0 vote311 views5 answers
Return tuple or null
C++
0 vote308 views1 answer
How to calculate bitwise xor c++
C++
0 vote317 views1 answer
Int a=0; int b=30;
C++
0 vote316 views3 answers
Hwo to send token on redirection in passport
C++
0 vote314 views1 answer
Cout hex c++
C++
0 vote357 views1 answer
'std::ifstream file' has incomplete type and cannot be defined
C++