Cod sursa(job #2886896)
| Utilizator | Data | 8 aprilie 2022 16:15:43 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
set < int > h;
int main(){
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int n, v[200001], k = 0;
in >> n;
for( int i = 0; i < n; i++ ){
int op;
in >> op;
if( op == 1 || op == 2 ){
int x;
in >> x;
if( op == 1 ){
h.insert( x );
v[k++] = x;
}
else if( op == 2 )
h.erase( v[x - 1] );
}
else
out << *h.begin() << "\n";
}
in.close();
out.close();
return 0;
}