Cod sursa(job #1081175)
Utilizator | Data | 13 ianuarie 2014 12:09:49 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
#include <set>
using namespace std;
ifstream fi("heapuri.in");
ofstream fo("heapuri.out");
set <int> H;
int n,t,i,x,k,v[200005];
int main () {
fi >> n;
for (i = 1; i <= n; i++) {
fi >> t;
if (t == 1) {
fi >> x;
H.insert(x);
v[++k] = x;
continue;}
if (t == 2) {
fi >> x;
H.erase(v[x]);
continue;}
if (t == 3) {
set<int>::iterator it = H.begin();
fo << *it << "\n";}}
return 0;}