Cod sursa(job #2739882)
| Utilizator | Data | 10 aprilie 2021 14:50:19 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.85 kb |
#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;
}
