Cod sursa(job #2571185)
Utilizator | Data | 4 martie 2020 21:30:54 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
multiset<int>heap;
int n, poz[10000001],k,a,x;
int main()
{
in>>n;
for(int i=1;i<=n;i++){
int q;
in>>q;
if(q==1){
int elem;
in>>elem;
heap.insert(elem);
poz[++k]=elem;
}
if(q==2){
int x;
in>>x;
heap.erase(poz[x]);
}
if(q==3) out<<*heap.begin()<<'\n';
}
return 0;
}