Cod sursa(job #2390992)
| Utilizator | Data | 28 martie 2019 16:32:25 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, p, x, nr, minim;
vector<int>v;
vector<int>u;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>p;
if(p==1)
{
f>>x;
v.push_back(x);
u.push_back(x);
}
else if(p==2)
{
f>>x;
v.erase(u.begin()+x);
}
else g<<*min_element(v.begin(), v.end())<<'\n';
}
return 0;
}
