Cod sursa(job #1937904)
Utilizator | Data | 24 martie 2017 13:15:01 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
void solveA()
{
set<int> myset;
int t,pos[200003],x,op,i=0;
f>>t;
while(t--)
{
f>>op;
switch(op)
{
case 1:
i++;
f>>x;
myset.insert(x);
pos[i] = x;
break;
case 2:
f>>x;
myset.erase(pos[x]);
break;
case 3:
g<<*myset.begin()<<'\n';
break;
}
}
}
int main()
{
solveA();
return 0;
}