Pagini recente » Cod sursa (job #2767860) | Cod sursa (job #1793317) | Cod sursa (job #349268) | Cod sursa (job #3200169) | Cod sursa (job #2901363)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n, p, x, mini = 1e6, y = 1;
vector<pair<int,int>> v;
int main()
{
fin >> n;
while(n--)
{
fin >> p;
mini = 1e6;
if(p == 1)
{
fin >> x;
v.push_back({x, y});
y++;
}
else if(p == 2)
{
fin >> x;
int j;
for(int i = 0; i < v.size(); i++)
{
if(x == v[i].second)
{
j = i;
break;
}
}
v.erase(v.begin() + j);
}
else
{
for(int i = 0; i < v.size(); i++)
{
if(mini > v[i].first)
mini = v[i].first;
}
fout << mini << '\n';
}
for(int i = 0; i < v.size(); i++)
cout << v[i].first << " ";
cout << endl;
/*
cout << p;
cout << endl;*/
}
return 0;
}