Mai intai trebuie sa te autentifici.
Cod sursa(job #3129877)
| Utilizator | Data | 16 mai 2023 05:59:52 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.89 kb |
#include <iostream>
#include <fstream>
#include <set>
std::ifstream fcin("heapuri.in");
std::ofstream fcout("heapuri.out");
std::set<int> heap;
const int N = 2e5;
int n, nr, cod, val, v[200001];
void insertValue(int val)
{
v[++nr] = val;
heap.insert(val);
}
void eraseValue(int val)
{
heap.erase(v[val]);
}
int getMinimumValue()
{
return *heap.begin();
}
int main()
{
fcin >> n;
for (int i = 1; i <= n; i++)
{
fcin >> cod;
if (cod == 1)
{
fcin >> val;
insertValue(val);
}
else if (cod == 2)
{
fcin >> val;
eraseValue(val);
}
else if (cod == 3)
{
int minimumValue = getMinimumValue();
fcout << minimumValue << '\n';
}
}
fcin.close();
fcout.close();
return 0;
}
