Cod sursa(job #2748164)
| Utilizator | Data | 29 aprilie 2021 23:03:40 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
vector<int> pozitii(200001);
set<int> s;
int main()
{
int n, m, a, nr, i;
nr=1;
f>>n;
for(i=1; i<=n; i++)
{
f>>m;
if(m==1)
{
f>>a;
s.insert(a);
pozitii[nr++]=a;
}
else if(m==2)
{
f>>a;
s.erase(pozitii[a]);
}
else
{
g<<*s.begin()<<'\n';
}
}
return 0;
}
