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

3 votes343 views3 answers
Find an element in vector of pair c++
C++
22 votes319 views4 answers
Height of the tree
C++
0 vote355 views1 answer
Get spaces in cin c++
C++
0 vote357 views1 answer
Sync_with_stdio
C++
2 votes308 views2 answers
Run cmd command c++
C++
0 vote340 views1 answer
Template member functions in cpp files
C++
0 vote317 views1 answer
C++ loop trhought object
C++
0 vote321 views1 answer
Vector c++ length integer
C++
0 vote410 views1 answer
Find number of 1s in a binary cv::mat image
C++
0 vote299 views10 answers
Convert c++ code to c online
C++