Cod sursa(job #3165160)
Utilizator | Data | 5 noiembrie 2023 15:54:26 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int MAX = 200000;
const int lim = 1000000000;
int v[MAX+1];
int main()
{
int n,c,x,cnt=0;
in>>n;
for(int i=0; i<n; ++i)
{
in>>c;
if(c==1)
{
in>>x;
v[cnt]=x;
++cnt;
}
else if(c==2)
{
in>>x;
v[x-1]=-1;
}
else
{
int mini=lim;
for(int j=0; j<cnt; ++j)
{
//out<<v[j]<<' ';
if(v[j]<mini && v[j]>-1)
mini=v[j];
}
// out<<'\n';
out<<mini<<'\n';
}
}
return 0;
}