Cod sursa(job #2137129)
Utilizator | Data | 20 februarie 2018 17:06:42 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int v[200001];
int main()
{
int op,x,n;
in >> n;
set<int> myset;
int indexinsert=1;
for(int i = 0 ; i < n ; i++)
{
in >> op;
switch(op)
{
case 1:
in >> x;
v[indexinsert++] = x;
myset.insert(x);
break;
case 2:
in >> x;
myset.erase(v[x]);
break;
case 3: out<<*myset.begin()<<'\n';
break;
}
}
return 0;
}