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 vote246 views1 answer
C++ check if cin got the wrong type
C++
0 vote279 views1 answer
C create 1 bit value
C++
1 vote277 views1 answer
How to create a struct in c++
C++
0 vote242 views1 answer
C++ print unsigned long
C++
3 votes227 views1 answer
How to convert qt string to string
C++
1 vote252 views1 answer
G++ optimization flags
C++
0 vote261 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
0 vote239 views1 answer
Ue4 foreach loop c++
C++
0 vote253 views1 answer
Passing a 2d array cpp
C++
1 vote295 views1 answer
Can you verify adsense no ssl certificate
C++