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 vote147 views1 answer
Insert only unique values into vector
C++
1 vote139 views1 answer
Implementation of Extended Euclidian theorem
C++
0 vote138 views1 answer
Count spaces in string java
C++
0 vote143 views1 answer
Post order from preorder and inorder calculator
C++
0 vote132 views1 answer
Const in c++ is same as globle in python
C++
0 vote152 views1 answer
Pop off end of string c++
C++
0 vote131 views1 answer
C++ multiple if conditions
C++
0 vote202 views1 answer
Opencv compile c++
C++
0 vote138 views1 answer
Cpp set time
C++
0 vote138 views1 answer
C++ open all files in directory
C++