Cod sursa(job #273156)
| Utilizator | Data | 8 martie 2009 11:31:45 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream.h>
#include<fstream.h>
ifstream f("heapuri.in");
ofstream h("heapuri.out");
int n,v[1000],a[1000][1000],k,i,j,min;
int main()
{f>>n;k=1;
for(i=1;i<=n;i++)
{f>>a[i][1];
if (a[i][1]!=3) f>>a[i][2];
else a[i][2]=0;}
for(i=1;i<=n;i++)
if(a[i][1]==1) {v[k]=a[i][2];k++;}
else if(a[i][1]==2) { for(j=a[i][2];j<k;j++) v[j]=v[j+1];
k--;}
else {min=v[1];
for(j=2;j<k;j++) if(v[j]<min) min=v[j];
h<<min<<'\n';}
return 0;
}