Cod sursa(job #3129574)
| Utilizator | Data | 14 mai 2023 22:15:49 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
long long n,a,x;
vector<long long> v;
set<long long> s;
fin>>n;
for(long long i=0; i<n; i++){
fin>>a;
if(a==1){
fin>>x;
v.push_back(x);
s.insert(x);
}
else if(a==2){
fin>>x;
s.erase(v[x-1]);
}
else if(a==3){
fout<<s.begin()<<endl;
}
}
fin.close();
fout.close();
return 0;
}
