Cod sursa(job #1490184)

Utilizator TibixbAndrei Tiberiu Tibixb Data 22 septembrie 2015 21:03:31
Problema Heapuri Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.71 kb
#include<fstream>
using namespace std;
int n, i, op, x, a[200003], h[200003], p[200003], s, p1, aux, nr, nrh, cronos;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int main()
{
    in>>n;
    for(i=1; i<=n; i++)
    {
        in>>op;
        if(op==3)
            out<<a[h[1]]<<"\n";
        if(op==1)
        {
            in>>x;
            a[++nr]=x;
            h[++nrh]=nr;
            p[nr]=nrh;
            s=nrh;
            p1=s/2;
            while(p1>0 && a[h[s]]<a[h[p1]])
            {
                aux=h[s];
                h[s]=h[p1];
                h[p1]=aux;
                p[h[s]]=s;
                p[h[p1]]=p1;
                s=p1;
                p1/=2;
            }
        }
        if(op==2)
        {
            in>>cronos;
            a[cronos]=-1;
            s=p[cronos];
            p1=s/2;
            while(p1>0 && a[h[s]]<a[h[p1]])
            {
                aux=h[s];
                h[s]=h[p1];
                h[p1]=aux;
                p[h[s]]=s;
                p[h[p1]]=p1;
                s=p1;
                p1/=2;
            }
            h[1]=h[nrh];
            nrh--;
            p[h[1]]=1;
            p1=1;
            s=2*p1;
            while(s<=nrh && a[h[s]]<a[h[p1]])
            {
                if(s+1<=nrh && a[h[s+1]]<a[h[s]])
                    s++;
                if(a[h[s]]<a[h[p1]])
                {
                    aux=h[s];
                    h[s]=h[p1];
                    h[p1]=aux;
                    p[h[s]]=s;
                    p[h[p1]]=p1;
                    p1=s;
                    s*=2;
                }else
                    break;
            }
        }
    }
}