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 vote120 views2 answers
C++ example
C++
-1 vote115 views1 answer
C++ itoa
C++
0 vote126 views1 answer
Prevent copy c++
C++
1 vote152 views1 answer
Qt qstring to double
C++
1 vote124 views1 answer
C++ check if cin didn't get int
C++
2 votes114 views1 answer
How to complie with c++ 17
C++
0 vote111 views2 answers
Css window id
C++
0 vote116 views1 answer
Hello world cc++
C++
0 vote103 views1 answer
Is obje file binary??
C++
0 vote116 views1 answer
First and last digit of a number in c++
C++