Pagini recente » Borderou de evaluare (job #1566674) | Borderou de evaluare (job #286968) | Borderou de evaluare (job #473721) | Cod sursa (job #2889599) | Cod sursa (job #3132239)
#include <stdio.h>
#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[i];
heap.insert(v[i-1]);
} else if (s == 2){
f>>m;
heap.erase(v[m]);
} else {
set<int>::iterator t = heap.begin();
r<<*t<<endl;
}
}
return 0;
}