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

10 votes106 views3 answers
Remove last character from string c++
C++
2 votes117 views2 answers
C++ length of char*
C++
0 vote102 views1 answer
Create new node in tree
C++
7 votes100 views3 answers
Length of 2d array c++
C++
19 votes92 views1 answer
Access last element in vector in c++
C++
1 vote93 views1 answer
Get an array with c++
C++
0 vote93 views1 answer
Move assignment operator c++
C++
0 vote86 views1 answer
Run c++ files on chrome book
C++
3 votes106 views1 answer
Rick astley - never gonna give you up
C++
1 vote101 views1 answer
Memcpy c++ usage
C++