https://wiki.ta.in.th/index.php?action=history&feed=atom&title=Binary_Heap 2026-06-16T23:02:00Z Revision history for this page on the wiki MediaWiki 1.33.0-alpha https://wiki.ta.in.th/index.php?title=Binary_Heap&diff=85&oldid=prev 2019-03-07T17:11:32Z

<p>Created page with &quot;== Priority Queue == &lt;pre&gt; #include&lt;stdio.h&gt; int pq[100000],n; int cmd; int main(){ while(true){ scanf(&quot;%d&quot;,&amp;cmd); // cmd = 0 : push / cmd = 1 : top / cmd = 2 : po...&quot;</p> <p><b>New page</b></p><div>== Priority Queue ==<br /> &lt;pre&gt;<br /> #include&lt;stdio.h&gt;<br /> int pq[100000],n;<br /> int cmd;<br /> int main(){<br /> while(true){<br /> scanf(&quot;%d&quot;,&amp;cmd); // cmd = 0 : push / cmd = 1 : top / cmd = 2 : pop / cmd = 3 : end<br /> if(cmd == 0){ // push<br /> scanf(&quot;%d&quot;,&amp;pq[n]);<br /> int pos = n;<br /> while(pos&gt;0 &amp;&amp; pq[pos] &gt; pq[(pos-1)/2]){<br /> int t = pq[pos];<br /> pq[pos] = pq[(pos-1)/2];<br /> pq[(pos-1)/2] = t;<br /> pos = (pos-1)/2;<br /> }<br /> n++;<br /> }else if(cmd == 1){ // top<br /> if(n==0) printf(&quot;NO DATA\n&quot;);<br /> else printf(&quot;TOP : %d\n&quot;,pq[0]);<br /> }else if(cmd == 2){ // pop<br /> if(n==0) continue;<br /> pq[0] = pq[n-1];<br /> n--;<br /> int pos = 0,newpos;<br /> while(true){<br /> newpos = -1;<br /> if(2*pos+1 &gt;= n) break;<br /> if(pq[pos] &lt; pq[2*pos+1]) newpos = 2*pos+1;<br /> if(2*pos+2 &lt; n &amp;&amp; pq[pos] &lt; pq[2*pos+2] &amp;&amp; pq[2*pos+2] &gt; pq[2*pos+1]) newpos = 2*pos+2;<br /> if(newpos == -1) break;<br /> int t = pq[pos];<br /> pq[pos] = pq[newpos];<br /> pq[newpos] = t;<br /> pos = newpos;<br /> }<br /> //printf(&quot;n = %d\n&quot;,n);<br /> }else break;<br /> }<br /> }<br /> <br /> &lt;/pre&gt;</div>

Tata