Cod sursa(job #273169)
| Utilizator | Data | 8 martie 2009 11:47:24 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream.h>
#include<fstream.h>
ifstream f("heapuri.in");
ofstream h("heapuri.out");
int n,v[1000],x,y,k,i,j,min;
int main()
{f>>n;k=1;
for(i=1;i<=n;i++)
{f>>x;
if(x==1) {f>>y;
v[k]=y;
k++;}
else if(x==2) {f>>y;
for(j=y;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;
}