Cod sursa(job #1255066)
Utilizator | Data | 4 noiembrie 2014 11:55:32 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<cstdio>
#include "heap.h"
using namespace std;
int heap[200001],v[200001],poz[200001],n;
int main ()
{freopen ("heapuri.in","r",stdin);
freopen ("heapuri.out","w",stdout);
int m,i,op,x,k=0;
scanf("%d",&m);
for(i=1;i<=m;i++)
{scanf("%d",&op);
if(op<=2)
{k++;
scanf("%d",&v[k]);
}
if(op==1)
insert(v[k],heap,v,poz,n);
if(op==2)
erase(v[k],heap,v,poz,n);
if(op==3)
maximul(heap,v,poz);
}
return 0;
}