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

1 vote136 views1 answer
C++ check if debug or release visual studio
C++
0 vote102 views1 answer
Replace a substring with another string in c++
C++
2 votes181 views2 answers
Cannot open include file:
C++
0 vote133 views1 answer
Attack on titan junior high list of episodes
C++
-1 vote166 views1 answer
Intersection between vector c++
C++
19 votes147 views3 answers
Segmentation fault (core dumped)
C++
1 vote145 views3 answers
If else c++
C++
0 vote163 views1 answer
Basic stack implementation in c++
C++
19 votes161 views1 answer
How to output to a file in c++
C++
0 vote130 views1 answer
Binary multiplication
C++