Cod sursa(job #2492062)
| Utilizator | Data | 13 noiembrie 2019 21:32:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<bits/stdc++.h>
#define N 200007
using namespace std;
int pos[N];
FILE* in=fopen("heapuri.in", "r");
FILE* out=fopen("heapuri.out", "w");
set<int> heap;
int main()
{
int n;
fscanf(in, "%d", &n);
int op, ct=0, x;
for(int i=1; i<=n; ++i)
{
fscanf(in, "%d", &op);
if(op==1)
{
fscanf(in, "%d", &x);
heap.insert(x);
pos[++ct]=x;
}
if(op==2)
{
fscanf(in, "%d", &x);
heap.erase(pos[x]);
}
if(op==3) fprintf(out, "%d\n", *heap.begin());
}
}
