Cod sursa(job #2833783)
| Utilizator | Data | 15 ianuarie 2022 18:14:13 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f ("heapuri.in");
ofstream g ("heapuri.out");
int main()
{
set <int> Set;
int n, option, x;
int a[200001], loc = 0;
f >> n;
for (int i = 1; i <= n; i++)
{
f >> option;
switch (option)
{
case 1:
f >> x;
Set.insert(x);
a[++loc] = x;
break;
case 2:
f >> x;
Set.erase(a[x]);
break;
case 3:
g << *Set.begin() << "\n";
break;
}
}
}
