Cod sursa(job #1862150)
Utilizator | Data | 29 ianuarie 2017 16:04:19 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
int n, v[200001];
multiset <int> heap;
f >> n;
short x, s = 0;
for(int i = 1; i <= n; i++)
{
f >> x;
if(x == 1)
{
f >> v[++s];
heap.insert(v[s]);
}
else if(x == 2)
{
int k;
f >> k;
heap.erase(v[k]);
}
else if(x == 3)
{
multiset <int> :: iterator p = heap.begin();
g << *p << "\n";
}
}
return 0;
}