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 vote306 views1 answer
Google pdf iframe viwer
C++
1 vote331 views1 answer
C++ vector of class objects
C++
3 votes308 views2 answers
Convert binary string to int c++
C++
0 vote314 views1 answer
C++ how to check whether a file exists?
C++
1 vote358 views1 answer
C++ delete directory
C++
0 vote314 views1 answer
How to adjust and delete memory in c, c++
C++
0 vote326 views1 answer
C if
C++
0 vote353 views1 answer
Ubuntu dotnet core install
C++
0 vote331 views1 answer
Priority queue smallest first
C++
0 vote329 views1 answer
Assign array to array
C++