Cod sursa(job #672996)
| Utilizator | Data | 3 februarie 2012 17:24:22 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
int main()
{
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int n, code, value, i = 1;
int order[200001];
set<int> h;
in >> n;
while(n--)
{
in >> code;
switch(code)
{
case 1:
{
in >> value;
h.insert(value);
order[i++] = value;
break;
}
case 2:
{
in >> value;
h.erase( order[value] );
break;
}
case 3:
{
out << *h.begin() << endl;
break;
}
}
}
return 0;
}
