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 vote127 views1 answer
Get type of variable in c++
C++
1 vote135 views1 answer
Cpp executing without console
C++
0 vote158 views1 answer
What is 10 + (-4)
C++
0 vote139 views1 answer
Print linked list reverse order in c++
C++
0 vote154 views1 answer
C++ rainbow text
C++
1 vote132 views1 answer
C++ insert variable into string
C++
1 vote174 views1 answer
Tarray ue4 c++
C++
1 vote130 views1 answer
What is difference between single inverted and double inverted in programming languages
C++
0 vote134 views1 answer
Max pooling in c++
C++
0 vote139 views3 answers
Online c++ compiler
C++