Pagini recente » Cod sursa (job #2897571) | Cod sursa (job #2703768) | Cod sursa (job #83382) | Cod sursa (job #779416) | Cod sursa (job #2302729)
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> h ;
int place[200001] ;
int n , p , k = 0 , x;
int main()
{
f >> n;
for (int i = 1 ; i <= n ; i++)
{
f >> p ;
if (p == 1)
{
f >> x ;
h.insert(x) ;
k ++ ;
place[k] = x ;
}
else if (p == 2)
{
f >> x;
h.erase(place[x]);
}
else if (p == 3)
g << *h.begin() << '\n';
}
return 0;
}