Pagini recente » Clasamentul arhivei de probleme | Clasamentul arhivei de probleme | Clasamentul arhivei de probleme | Cod sursa (job #1231823) | Cod sursa (job #2421813)
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
long long v[200001],m;
int main()
{
int n;
f>>n;
for(int i=1;i<=n;i++)
{
long long a,b;
f>>a;
if(a!=3)
f>>b;
if(a==1)
{
m++;
v[m]=b;
}
if(a==2)
{
for(int j=b;j<m;j++)
{
v[j]=v[j+1];
}
m--;
}
if(a==3)
{
long long minim=v[1];
for(int j=2;j<=m;j++)
if(minim>v[j])
minim=v[j];
g<<minim<<'\n';
}
}
return 0;
}