Cod sursa(job #2082101)

Utilizator Cristian25Cristian Stanciu Cristian25 Data 5 decembrie 2017 18:35:05
Problema Heapuri Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
//Enunt: http://www.infoarena.ro/problema/heapuri
#include <iostream>
#include <fstream>

using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
void In(int x[],int &m,int valarray)
{
    ++m;
    x[m]=valarray;
}
void Out(int x[],int &m,int k)
{
    for(int i=k;i<m;++i)
        x[i]=x[1+i];
    --m;
}
int Minimum(int x[],int m)
{
    int min=x[1];
    for(int i=2;i<=m;++i)
        if(x[i]<min)
            min=x[i];
    return min;
}
int main()
{
    int N,x,a[200001]={0},n=0;
    short op;
    in>>N;
    for(int i=0;i<N;++i)
    {
        in>>op;
        if(op==1)
        {
            in>>x;
            In(a,n,x);
        }
        else if(op==2)
        {
            in>>x;
            Out(a,n,x);
        }
        else out<<Minimum(a,n)<<'\n';
    }
    return 0;
}