Cod sursa(job #879461)
Utilizator | Vaduva Gabriel vgabi94 | Data | 15 februarie 2013 14:16:03 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int crono[200001];
int main()
{
int n, c = 0, x, y; in >> n;
multiset<int> hp;
for (int i = 0; i < n; i++)
{
in >> x;
switch(x)
{
case 1: { in >> y; hp.insert(y); crono[++c] = y; } break;
case 2: { in >> y; hp.erase(crono[y]); } break;
case 3: out << *hp.begin() << '\n'; break;
}
}
return 0;
}