We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
At last successfully passed all test cases.
here is my code below..
#include<bits/stdc++.h>usingnamespacestd;#define NN 100000 //Heap sizestructminHeap{intn;//number of nodes in heapArrintheapArr[NN+1];//array is 1 basedminHeap(){n=0;}voidmin_heapify(intindex);voidinsert(intk);intsearch(intk);voiddeleteKey(intk);intgetMin();};voidminHeap::min_heapify(inti){intl=2*i;intr=2*i+1;intmin=i;if(l<n&&heapArr[l]<heapArr[min])min=l;if(r<n&&heapArr[r]<heapArr[min])min=r;if(min!=i){swap(heapArr[i],heapArr[min]);min_heapify(min);}}voidminHeap::insert(intk){if(n==NN)return;n++;heapArr[n]=k;intp=n;while(p>1){intpr=p/2;if(heapArr[pr]>heapArr[p]){swap(heapArr[pr],heapArr[p]);p=pr;}elsebreak;}}intminHeap::getMin(){if(n==0)return-1;elsereturnheapArr[1];}intminHeap::search(intele){for(inti=1;i<=n;i++){if(heapArr[i]==ele)returni;}return-1;}voidminHeap::deleteKey(intele){intindex=search(ele);heapArr[index]=heapArr[n];n--;min_heapify(index);}intmain(){minHeaph;intq,t,x;cin>>q;while(q--){cin>>t;if(t==1){cin>>x;h.insert(x);}elseif(t==2){cin>>x;h.deleteKey(x);}else{cout<<h.getMin()<<endl;}}}
QHEAP1
You are viewing a single comment's thread. Return to all comments →
At last successfully passed all test cases. here is my code below..