Pagini recente » Cod sursa (job #2121254) | Cod sursa (job #1468380) | Cod sursa (job #2339723) | Cod sursa (job #3269001) | Cod sursa (job #1318926)
#include<fstream>
#include<set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int a[1000231];
int n,k,i,poz;
multiset<int> heap;
int main()
{ int x;
f>>n;
for (i=1; i<=n ; ++i)
{ f>>k;
if (k==1)
{f>>x;
a[++poz]=x;
heap.insert(x);
}
if (k==2)
{
f>>x;
heap.erase(heap.find(a[x]));
}
if (k==3)
{
g<<*heap.begin()<<"\n";
}
}
f.close();
g.close();
return 0;
}