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

9 votes119 views2 answers
C++ remove last element from array
C++
0 vote112 views1 answer
C++ tokenize string
C++
0 vote114 views1 answer
If(arr[i]==k) return arr[i];
C++
6 votes119 views1 answer
C++ estimate deciimal to a point
C++
0 vote122 views1 answer
Result += a +b in c++ meaning
C++
1 vote122 views1 answer
HOW TO TURN LINK TO BUTTON IN MVC
C++
1 vote307 views1 answer
BAPS
C++
1 vote193 views1 answer
C++ uniform_real_distribution get same result
C++
0 vote140 views1 answer
Mingw32/bin/ld.exe: C:\Users\mfrom\AppData\Local\Temp\ccSKcRks.o:PizzaPi.cpp:(.text$_ZN5PizzaC2Ev[__ZN5PizzaC2Ev]+0xa): undefined reference to `vtable for Pizza' collect2.exe: error: ld returned 1 exit status
C++
2 votes84 views1 answer
Read int from file c++
C++