Cod sursa(job #2890996)
Utilizator | Data | 17 aprilie 2022 12:32:14 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main()
{
set<int> myset;
set<int>::iterator itr;
int n, x, op, v[200005], k=0;
fin>>n;
for(int i=0; i<n; i++)
{
fin >> op;
if(op == 1)
{
fin >> x;
v[++k] = x;
myset.insert(x);
}
else if(op == 2)
{
fin >> x;
myset.erase(v[x]);
}
else if(op == 3)
{
itr = myset.begin();
fout << *itr << "\n";
}
}
return 0;
}