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

5 votes338 views1 answer
Qdebug
C++
1 vote334 views1 answer
Implementation of Extended Euclidian theorem
C++
-1 vote433 views1 answer
How to replace an element in array in c++
C++
20 votes381 views3 answers
How to append to a vector c++
C++
0 vote384 views1 answer
Gettimeofday header file
C++
0 vote327 views1 answer
C++ std::find with lambda
C++
0 vote335 views1 answer
C++ capture screen as pixel array
C++
0 vote322 views1 answer
Check if equal to \ char or not c++
C++
0 vote326 views1 answer
How to move your chrector in unity
C++
0 vote376 views1 answer
Know what the input data is whether integer or not
C++