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 vote140 views1 answer
Sento freddo a un dente
C++
1 vote164 views1 answer
How to hide the c++ console
C++
0 vote159 views1 answer
Store arbitrarly large vector of doubles c++
C++
0 vote171 views1 answer
ViewController import
C++
7 votes168 views6 answers
Iterate through map
C++
8 votes141 views2 answers
Cpp print vector
C++
-1 vote139 views1 answer
A[12] = h + A[8]
C++
11 votes150 views3 answers
Count occurrences of character in string c++
C++
0 vote145 views1 answer
C++ descending sort
C++
0 vote141 views1 answer
Char at in c++
C++