Cod sursa(job #1887228)
Utilizator | Data | 21 februarie 2017 14:07:42 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define NMax 200005
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int N;
multiset<int> H;
int o[NMax],K;
int main()
{
fin>>N;
while(N--)
{
int op,x;
fin>>op;
if(op==1)
{
fin>>x;
H.insert(x);
o[++K]=x;
}
if(op==2)
{
fin>>x;
H.erase(o[x]);
}
if(op==3)
fout<<*H.begin()<<"\n";
}
return 0;
}