Cod sursa(job #3129162)
| Utilizator | Data | 12 mai 2023 22:11:01 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main() {
int nr_op, operatie, nr = 1;
vector<int> v;
f >> nr_op;
while (f >> operatie) {
switch (operatie) {
case 1:{
int nr2;
f >> nr2;
v.push_back(nr2);
break;
}
case 2:{
int nru;
f >> nru;
v.erase(v.begin()+nru - nr);
nr++;
break;
}
case 3:{
int n = 200000;
for(auto elem:v)
if (elem < n)
n = elem;
g << n << endl;
break;
}
}
}
f.close();
g.close();
return 0;
}
