Cod sursa(job #1533392)
Utilizator | Data | 22 noiembrie 2015 14:46:50 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <queue>
#include <set>
using namespace std;
int n,op,x,m,a[200000],i;
priority_queue< int, vector<int>, greater<int> > coada;
set <int> st;
int main()
{
ifstream f ("heapuri.in");
ofstream g ("heapuri.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>op>>x;
if (op==1)
{
st.insert(x);
m++;
a[m]=x;
}
if (op==2)
{
st.erase(a[x]);
}
if (op==3)
{
g<<*st.begin()<<"\n";
}
}
return 0;
}