Cod sursa(job #2532653)
| Utilizator | Data | 28 ianuarie 2020 08:23:24 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std;
#define NMAX 100002
int k=0;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main()
{
int poz[NMAX];
set <int> heap;
int n;
fin>>n;
for(int i=1;i<=n;i++)
{
int c;
fin>>c;
if(c==1)
{
int nr;
fin>>nr;
heap.insert(nr);
poz[++k] = nr;
}
else if(c==2)
{
int nr;
fin>>nr;
heap.erase(poz[nr]);
}
else
{
fout<<*heap.begin()<<'\n';
}
}
return 0;
}
