Cod sursa(job #2908981)
| Utilizator | Data | 7 iunie 2022 16:57:31 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int a, n, op;
set<int> heap;
vector<int> v;
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
in >> op;
if(op == 1)
{
in >> a;
v.push_back(a);
heap.insert(a);
}
if(op == 2)
{
in >> a;
heap.erase(v[a - 1]);
}
if(op == 3)
{
out << *(heap.begin());
out << "\n";
}
}
return 0;
}
