Cod sursa(job #1533387)
Utilizator | Nicu B. NicuCJ | Data | 22 noiembrie 2015 14:44:26 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
priority_queue< int, vector<int>, greater<int> > coada;
set <int> st;
int main()
{
int n,i,a[200001],b,c=0,x;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
f>>n;
for (i=1;i<=n;i++){
f>>x;
if (x==1){
f>>b;
st.insert(b);
a[++c]=b;
}
if (x==2){
f>>b;
st.erase(a[b]);
}
if (x==3){
g<<*st.begin()<<'\n';
}
}
return 0;
}