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 vote544 views1 answer
Cpp class access array member by different name
C++
6 votes118 views2 answers
Get data from terminal c++
C++
0 vote131 views1 answer
C++ open all files in directory
C++
24 votes139 views3 answers
C++ function
C++
18 votes126 views3 answers
Sort(arr arr+n) in c++
C++
0 vote137 views3 answers
Options select from array
C++
2 votes116 views2 answers
File open cpp
C++
10 votes119 views3 answers
What is pi
C++
0 vote141 views1 answer
Cpp serial print override always in same place
C++
-1 vote125 views5 answers
C++ string split
C++