Cod sursa(job #3128711)
Utilizator | Data | 10 mai 2023 16:43:02 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int a[200100], n, cnt;
set<int> q;
int main(){
int t, x;
in >> t;
while( t-- ){
cin >> n;
if(n == 3)
out << *(q.begin()) << '\n';
else{
in >> x;
if(n == 1){
a[++cnt]=x;
q.insert(x);
}
else
q.erase(a[x]);
}
}
}