Cod sursa(job #2629025)
Utilizator | Data | 18 iunie 2020 17:04:55 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
const int N=200010;
int n,m,op,x,v[N];
set<int> s;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>op;
if(op==1)
{
f>>x;
v[++m]=x;
s.insert(x);
}
else
if(op==2)
{
f>>x;
x=v[x];
s.erase(x);
}
else
{
g<<*s.begin()<<'\n';
}
}
return 0;
}