Cod sursa(job #3212096)
| Utilizator | Data | 11 martie 2024 09:24:29 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
#include <set>
#define N 200005
#include <vector>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,nr,x,cod;
multiset <int> my_set;
vector <int> ord(N);
int main()
{
f >> nr;
while (nr)
{
f >> cod;
if (cod == 1)
{
f >> x;
ord[++n] = x;
my_set.insert(x);
}
else if (cod == 2)
{
f >> x;
my_set.erase(ord[x]);
}
else
{
multiset <int> :: iterator minim = my_set.begin();
g << *minim <<'\n';
}
nr--;
}
return 0;
}
