Cod sursa(job #2289818)
| Utilizator | Data | 25 noiembrie 2018 12:49:48 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int v[200003],n,op,m;
multiset<int>heap;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>op;
if(op==1)
{
m++;
fin>>v[m];
heap.insert(v[m]);
}
else if(op==2)
{
int x;
fin>>x;
heap.erase(heap.find(v[x]));
}
else if(op==3)
{
multiset<int> :: iterator it=heap.begin();
fout<<*it<<'\n';
}
}
}
