Pagini recente » Cod sursa (job #2739155) | Cod sursa (job #2342519) | Cod sursa (job #2658625) | Cod sursa (job #3167720) | Cod sursa (job #2845827)
#include <fstream>
#include <set>
using namespace std;
ifstream f ("heapuri.in");
ofstream g ("heapuri.out");
int n, cerinta, nr;
int v[200005];
multiset < int > heap;
multiset < int > :: iterator it;
int main()
{
f >> n;
for (int i=1; i<=n; i++)
{
f >> cerinta;
if (cerinta == 1)
{
int x; f >> x;
heap.insert(x);
nr ++; v[nr] = x;
}
else if (cerinta == 2)
{
int x; f >> x;
heap.erase(heap.find(v[x]));
}
else
{
it = heap.begin();
g << *it << "\n";
}
}
return 0;
}