Pagini recente » Cod sursa (job #2743951) | Cod sursa (job #2429262) | Cod sursa (job #1240680) | Cod sursa (job #274404) | Cod sursa (job #2896306)
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
int n, i, instr, x, nr = 0;
f >> n;
set <int> heapus;
int ord[200001];
for(i = 0; i < n; i++)
{
f >> instr;
if(instr == 1)
{
f >> x;
nr++;
ord[nr] = x;
heapus.insert(x);
}
if(instr == 2)
{
f >> x;
heapus.erase(ord[x]);
}
if(instr == 3)
g << *heapus.begin() <<"\n";
}
return 0;
}