Cod sursa(job #3130443)
Utilizator | Data | 17 mai 2023 19:53:58 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("C:\\Users\\sumur\\Desktop\\SD\\heapuri\\heapuri.in");
ofstream out("C:\\Users\\sumur\\Desktop\\SD\\heapuri\\heapuri.out");
int main(){
int n,aux;
vector<int > m;
in >> n;
for(int i = 0 ; i < n ; i ++)
{
in >> aux;
if(aux == 1){
in >> aux;
m.push_back(aux);
}else if (aux == 2){
in >> aux;
m.erase(m.begin() + aux);
}else{
int min = m[1];
for(auto k:m)
if (min > k )
min = k;
out << min;
}
}
return 0;
}