Cod sursa(job #1354729)

Utilizator pitradaPit-Rada Ionel-Vasile pitrada Data 21 februarie 2015 23:23:31
Problema Heapuri Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.35 kb
#include<fstream>
using namespace std;

struct pereche
{
  int poz,val;
};
pereche v[200002];
int H[200002], pH, q, nH;
int n,a,c,x,i;

inline void adaug(int poz)
{
    int i,p,x;
    x=v[poz].val;
    nH++;
    // urcarea
    i=nH;
    p=i/2;
    pH=H[p];
    while(p && v[pH].val>x)
    {
        H[i]=pH;
        v[pH].poz=i;
        i=p;
        p=i/2;
    }
    H[i]=poz;
    v[poz].poz=i;
}
inline void sterg(int poz)
{
    int p,i;
    q=H[nH];
    nH--;
    p=v[poz].poz;
    while(2*p<=nH)
    {
        i=2*p;
        pH=H[i];
        if(i+1<=nH && v[H[i+1]].val<v[pH].val)
        {
            pH=H[i+1];
            i++;
        }
        if(v[pH].val<v[q].val)
        {
            H[p]=pH;
            v[pH].poz=p;
            p=i;
        }
        else break;
    }
    H[p]=q;
    v[q].poz=p;
}

int main()
{
     ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");
    fin>>n;
    c=0;
    nH=0;
    for(i=1;i<=n;i++)
    {
        fin>>a;
        if(a==1)
        {
            fin>>x;
            c++;
            v[c].val=x;
            adaug(c);
        }else
        if(a==2)
        {
            fin>>x;
            sterg(x);
        }else
        {
            fout<<v[H[1]].val<<endl;
        }
    }

    fin.close();
    fout.close();
    return 0;
}