Pagini recente » Cod sursa (job #1869217) | Cod sursa (job #2822278) | Cod sursa (job #2363086) | Cod sursa (job #3189909) | Cod sursa (job #2739882)
#include <bits/stdc++.h>
using namespace std;
long long v[200002];
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n;
fin>>n;
int k = 0;
for(int i = 1; i <= n; i++)
{
int op;
fin>>op;
if(op == 1)
{
k++;
int x;
fin>>x;
v[k] = x;
}
if(op == 2)
{
int x;
fin>>x;
v[x] = -1;
}
if(op == 3)
{
int minimum = 1000000002;
for(int q = 1; q <= k; q++){
if(v[q] != -1){
if(v[q] < minimum){
minimum = v[q];
}
}
}
fout << minimum<<"\n";
}
}
return 0;
}