Pagini recente » Cod sursa (job #1507147) | Cod sursa (job #1004475) | Cod sursa (job #1114651) | Cod sursa (job #1006157) | Cod sursa (job #2954352)
#include <fstream>
#include<bits/stdc++.h>
using namespace std;
vector<int> v;
vector<int> timp;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, cod, x;
f>>n;
for(int i = 1; i<=n; i++)
{
cod = 0;
f>>cod;
if(cod == 1)
{
f>>x;
v.push_back(x);
make_heap(v.begin(), v.end());
timp.push_back(x);
}
else if(cod == 2)
{
f>>x;
int y;
y = timp[x-1];
timp.erase(v.begin() + x);
for(int i = 0; i<v.size(); i++)
{
if(y == v[i])
{
v.erase(v.begin() + i);
}
}
make_heap(v.begin(), v.end());
}
/*else
{
int minn = 9999;
for(int i = 0; i<v.size(); i++)
{
if(v[i] < minn)
{
minn = v[i];
}
}
cout<<minn<<endl;
}*/
}
for(int i = 0; i<v.size()-1; i++)
{
cout<<v[i]<<" ";
}
return 0;
}