Cod sursa(job #1535137)

Utilizator TibixbAndrei Tiberiu Tibixb Data 24 noiembrie 2015 13:15:07
Problema Heapuri Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.79 kb
#include<fstream>
using namespace std;
int op, x, n, i, a[200002], h[200002], p[200002], s, p1, aux, kronos, nr, nrh;
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";
            continue;
        }
        if(op==1)
        {
            in>>x;
            a[++nr]=x;
            h[++nrh]=nr;
            p[nr]=nrh;
            s=nrh;
            p1=nrh/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;
            }
            continue;
        }
        if(op==2)
        {
            in>>kronos;
            s=p[kronos];
            p1=s/2;
            a[kronos]=-1;
            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];
            h[nrh]=0;
            nrh--;
            p1=1;
            s=2;
            while(s<=nrh)
            {
                if(s+1<=nrh && a[h[s]]>a[h[s+1]])
                    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;
            }
        }
    }
    return 0;
}