最小堆实现优先级队列

#include 
using namespace std;
class MinHeap{
private:
	int *heap;
	int currentsize;
	int maxsize;
public:
	MinHeap(int sz){
		maxsize=sz;
		heap=new int[maxsize];
		if(heap==NULL){
			cerr<<"distribute error!"<0){
		if(temp>=heap[j]){
			break;
		}
		if(temp>f;
		if(f==1){
			int num,c;
			cout<<"number of num:";
			cin>>c;
			while(c--){
				cin>>num;
				if(t.Insert(num)){
				    cout<<"Success!"<