Mai intai trebuie sa te autentifici.
Cod sursa(job #951141)
| Utilizator | Data | 19 mai 2013 15:53:02 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
long int v[1000],i,n,op,nr=1,x,j,aux,min=1000000000;
f>>n;
for(i=1;i<=n;i++)
{
f>>op;
if(op==1)
{
f>>x;
v[nr]=x;
nr++;
}
else if(op==2)
{
f>>x;
for(j=x;j<nr;j++)
{
aux=v[j];
v[j]=v[j+1];
v[j+1]=aux;
}
nr--;
}
else
{
for(j=1;j<nr;j++)
{
if(v[j]<min) min=v[j];
}
g<<min<<endl;min=1000000000;
}
}
return 0;
}
