Cod sursa(job #2611019)
Utilizator | Data | 6 mai 2020 09:48:28 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include<set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int>q;
int n,i,c,k,poz[200005],x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>c;
if(c==1)
{
f>>x;
q.insert(x);
poz[++k]=x;
}
else if(c==2)
{
f>>x;
q.erase(poz[x]);
}
else g<<*q.begin()<<'\n';
}
return 0;
}