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 vote323 views2 answers
Total sales in array c++ two dimensional array
C++
0 vote294 views1 answer
Fast i/o in c++
C++
0 vote324 views1 answer
Sfml keyboard events cpp
C++
39 votes375 views6 answers
How to Add to an Array
C++
0 vote335 views1 answer
Lexene token pairs of java codes
C++
0 vote304 views1 answer
Clear qlayout
C++
0 vote334 views1 answer
C++ excel cell blank cells
C++
0 vote327 views1 answer
Initialisation of a c++ variable
C++
0 vote330 views1 answer
Txt to pdf CPP
C++
2 votes358 views1 answer
Built in function in c++ for binary to decimal
C++