Pagini recente » Cod sursa (job #1871693) | Cod sursa (job #2609700) | Cod sursa (job #2872002) | Cod sursa (job #2260669) | Cod sursa (job #2906632)
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
vector<pair<int,int>>v;
int cron = 1,n,op,a;
int main()
{
int minim = 1000001;
in >> n;
for(int i = 1; i <= n; i++)
{
in >> op;
if(op == 1)
{
in >> a;
v.push_back({a,cron});
cron++;
}
else if(op == 2)
{
in >> a;
int j;
for(int i = 0; i < v.size(); i++)
{
if(v[i].second == a)
{
j = i;
break;
}
}
v.erase(v.begin() + j);
}
else if(op == 3)
{
minim = 1000001;
for(int i = 0; i < v.size(); i++)
{
if(v[i].first < minim)
minim = v[i].first;
}
out << minim << '\n';
}
}
return 0;
}