Cod sursa(job #2162118)
| Utilizator | Data | 12 martie 2018 01:47:44 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main()
{
set<int>Heap;
vector<int>InsertOrder;
int op,x,operations;
fin>>operations;
for(;operations;operations--)
{
fin>>op;
switch(op)
{
case 1:
fin>>x;
Heap.insert(x);
InsertOrder.push_back(x);
break;
case 2:
fin>>x;
Heap.erase(InsertOrder[x-1]);
break;
case 3:
fout<<*Heap.begin()<<'\n';
break;
}
}
return 0;
}
