Cod sursa(job #2026210)
Utilizator | Slevoaca Stefan-Gabriel Slevy | Data | 23 septembrie 2017 22:07:18 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
set<int> heap;
vector<int> inserted;
int main()
{
int n, op, val;
for (in >> n; n; --n) {
in >> op;
switch(op) {
case 1:
in >> val;
heap.insert(val);
inserted.push_back(val);
break;
case 2:
in >> val;
heap.erase(inserted[val - 1]);
break;
case 3:
out << *heap.begin() << "\n";
break;
}
}
in.close();
out.close();
return 0;
}