Cod sursa(job #776798)
Utilizator | Data | 10 august 2012 14:12:05 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<set>
using namespace std;
#define NMAX 200005
ifstream f("heapuri.in");
ofstream g("heapuri.out");
multiset<int> h;
int a[NMAX];
int n,nr;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
int op,x;
f>>op;
switch(op)
{
case 1:
++nr;
f>>a[nr];h.insert(a[nr]);break;
case 2:f>>x; h.erase(a[x]);break;
case 3:g<<*h.begin()<<'\n';
}
}
return 0;
}