Cod sursa(job #3345922)
| Utilizator | Data | 11 martie 2026 19:39:40 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#define NMAX 200005
using namespace std;
set <int> heap;
int n, poz[NMAX], k, a, x;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int main()
{
in>>n;
for(int i = 1; i <= n; i++)
{
in >> x;
if(x == 1)
{
in >> a;
heap.insert(a);
poz[++k] = a;
}
else if(x == 2)
{
in >> a;
heap.erase(poz[a]);
}
else
out << *heap.begin() << '\n';
}
return 0;
}
