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 vote281 views1 answer
Binpow in fenwick tree
C++
1 vote243 views1 answer
SFML window
C++
8 votes300 views1 answer
Remove or erase first and last character of string c++
C++
1 vote261 views1 answer
C++ pass argument to singleton
C++
0 vote267 views1 answer
C++ find index of all occurrences in string
C++
2 votes272 views1 answer
C++ flush stdin
C++
0 vote241 views1 answer
Str[i] - '0'
C++
0 vote269 views1 answer
Bnchch
C++
5 votes235 views3 answers
Print array c++
C++
0 vote505 views1 answer
Opengl draw house using glut c++
C++