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 vote190 views1 answer
C++ filesystem read directory
C++
0 vote195 views1 answer
Vector keyword in c++
C++
0 vote186 views1 answer
Cuda shared array
C++
0 vote252 views1 answer
Deletion in bst
C++
1 vote209 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
1 vote221 views1 answer
Qt remove resize handle
C++
0 vote200 views1 answer
C++ write number to registry
C++
5 votes178 views3 answers
Rand in C++
C++
7 votes181 views1 answer
How to make string get spaces c++
C++
0 vote175 views1 answer
Recursive power in c++
C++