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 vote136 views1 answer
Array must be initialized with a brace-enclosed initializer
C++
0 vote127 views1 answer
C++ get type name of object
C++
0 vote126 views1 answer
Fenwick tree
C++
-1 vote143 views1 answer
C++ forloop
C++
0 vote115 views1 answer
What is require to run min max function on linux in cpp
C++
0 vote123 views1 answer
Remove something from stringstream
C++
9 votes121 views4 answers
Range based for loop c++
C++
5 votes140 views5 answers
Convert char to int c++
C++
0 vote182 views1 answer
Statement that causes a function to end in c++
C++
-1 vote121 views1 answer
Combination sum iv leetcode
C++