Pagini recente » Cod sursa (job #133902) | Cod sursa (job #494712) | Cod sursa (job #333375) | Cod sursa (job #1966024) | Cod sursa (job #1221006)
#include<fstream>
#include<set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int v[200001], n, y, x, i, m;
int main()
{
multiset <int> Heap;
multiset <int> ::iterator Min;
f>>n;
for(i=1;i<=n;i++)
{
f>>y;
if(y==1)
{
f>>x;
v[++m]=x;
Heap.insert(x);
}
if(y==2)
{
f>>x;
Heap.erase(Heap.find(v[x]));
}
if(y==3)
{
Min=Heap.begin();
g<<*Min<<"\n";
}
}
f.close();
g.close();
return 0;
}