Pagini recente » Cod sursa (job #1191873) | Cod sursa (job #2314389) | Cod sursa (job #1848590) | Cod sursa (job #390354) | Cod sursa (job #3132240)
#include <set>
#include <fstream>
#define dim 200002
using namespace std;
ifstream f("loto.in");
ofstream r("loto.out");
int main(){
int n, i, s, m, p = 1, v[dim];
set<int> heap;
f>>n;
for (i=0; i<n; i++){
f>>s;
if(s == 1){
f>>v[p];
heap.insert(v[p-1]);
} else if (s == 2){
f>>m;
heap.erase(v[m]);
} else {
set<int>::iterator t = heap.begin();
r<<*t<<"\n";
}
}
return 0;
}