Cod sursa(job #2621278)
| Utilizator | Data | 30 mai 2020 13:52:35 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> v;
int nr, poz[200001], k = 1;
f>>nr;
for(int i=1; i<=nr; i++)
{
int x, y;
f>>x;
if(x == 1)
{
f>>y;
v.insert(y);
poz[k++] = y;
}
else if(x == 2)
{
f>>y;
v.erase(poz[y]);
}
else
g<<*(v.begin())<<"\n";
}
return 0;
}
