Cod sursa(job #2890798)
| Utilizator | Data | 16 aprilie 2022 17:28:50 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.91 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int main()
{
ifstream in("heapuri.in");
ofstream out("heapuri.out");
set <int> myset;
int n, x, op, v[200005], cnt = 0;
in>>n;
while(n != 0){
in>>op;
switch(op){
case 1:
{
in>>x;
cnt++;
myset.insert(x);
v[cnt] = x;
break;
}
case 2:
{
in>>x;
int val = v[x];
myset.erase(val);
break;
}
case 3:
{
out<<*myset.begin()<<"\n";
break;
}
default:
break;
}
n--;
}
out.close();
in.close();
return 0;
}
