Cod sursa(job #2488029)
Utilizator | Data | 6 noiembrie 2019 00:03:42 | |
---|---|---|---|
Problema | Heapuri | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set<int> s;
int n, t, x;
int v[200005];
int main()
{
fin >> n;
for (int i=0; i<n; i++)
{
fin >> t;
switch(t)
{
case 1:
fin >> x;
s.insert(x);
v[i] = x;
break;
case 2:
fin >> x;
s.erase(v[x-1]);
break;
case 3:
fout << *s.begin()<< '\n';
break;
default:
break;
}
}
return 0;
}