Cod sursa(job #2893049)
| Utilizator | Data | 24 aprilie 2022 20:50:15 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> multime;
int v[200001];
int main()
{
int N, cod, x, ct=1;
f >> N;
for(int i=1; i<=N; i++)
{
f >> cod;
if(cod == 1)
{
f >> x;
v[ct] = x;
ct++;
multime.insert(x);
}
else
if(cod == 2)
{
f >> x;
multime.erase(v[x]);
}
else
g << *multime.begin() << "\n";
}
}
