全wa？？？

手写小根堆怎么全wale ?? 求dalao看一下```cpp #include using namespace std; int heap[1000007]; int n; int heap_size;

void swap(int a,int b) { int tmp; tmp=a; a=b; b=tmp; }

void add(int a) { heap[++heap_size]=a; int now=heap_size,next;

while(now>1)
{
	next=now>>1;
	if(heap[now]>=heap[next]) return;
	swap(heap[now],heap[next]);
	now=next;
}

}

void del() { int now=1,next; heap[1]=heap[heap_size--]; while(now2<=heap_size) { next=now2; if(next<heap_size&&heap[next+1]<heap[next]) next++; if(heap[next]>=heap[now]) break; swap(heap[next],heap[now]); now=next; } }

int main() { int x; cin>>n; //heap_size=n; int num; for(int i=1;i<=n;i++) { cin>>x; if(x==1) { cin>>num; add(num); }

	if(x==2)
	{
		cout<<heap[1]<<endl;
	}
	if(x==3)
	{
		del();
	}
}
return 0;

}