Min heap priority queue c++

#include<queue>
std::priority_queue <int, std::vector<int>, std::greater<int> > minHeap;

Create a min heap in java using priority queue

int arr[]={1,2,1,3,3,5,7};
        PriorityQueue<Integer> a=new PriorityQueue<>();
        for(int i:arr){
            a.add(i);
        }
        while(!a.isEmpty())
            System.out.println(a.poll());

Similar codes

0 vote169 views1 answer
Idnefier endl in undefince
C++
11 votes178 views1 answer
Inserting at start in vector c++
C++
18 votes199 views4 answers
Array length c++
C++
0 vote229 views1 answer
Program in c++ for simple interest rate
C++
0 vote194 views1 answer
C++ delete printed characters
C++
0 vote209 views2 answers
C++ namespace
C++
2 votes133 views1 answer
How to fill all of the array in c++
C++
2 votes195 views1 answer
Variable vs pointer in c++
C++
481 votes508 views10 answers
December global holidays
C++
0 vote279 views1 answer
Check if float has decimals c++
C++