Cod sursa(job #1628314)
Utilizator | Data | 3 martie 2016 22:51:05 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,x[200001],k,a,b;
set<int> h;
int main()
{
f>>n;
for(int i=1;i<=n;i++){
f>>a;
if(a==3)
g<<*h.begin()<<"\n";
if(a==1){
f>>x[++k];
h.insert(x[k]);}
else
if(a==2){
f>>b;
h.erase(x[b]);}
}
return 0;
}