Cod sursa(job #240485)
| Utilizator | Data | 7 ianuarie 2009 18:45:45 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <stdio.h>
int V[200100],i,j,nr,min,a,x,N;
int main()
{
freopen("heapuri.in","r",stdin);
scanf("%d", &N);
nr=0;
freopen("heapuri.out","w",stdout);
for (i=1;i<=N;++i)
{
scanf("%d", &a);
if (a==1)
{
nr++;
scanf("%d",&x);
V[nr]=x;
}
else
if (a==2)
{
scanf("%d", &x);
for (j=x;j<=nr;++j)
V[j]=V[j+1];
nr--;
}
else
{
min=1000000;
for (j=1;j<=nr;++j)
if (V[j]<min)
min=V[j];
printf("%d\n", min);
}
}
return 0;
}