Cod sursa(job #2621261)
Utilizator | Data | 30 mai 2020 13:45:48 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 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;
}
if(x == 2)
{
f>>y;
v.erase(poz[y]);
}
if(x == 3)
{
g<<*(v.begin())<<endl;
}
}
return 0;
}