Pagini recente » Cod sursa (job #365568) | Cod sursa (job #2775568) | Cod sursa (job #2743303) | Cod sursa (job #1537512) | Cod sursa (job #2894484)
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FILE "heapuri"
using namespace std;
ifstream fin(FILE".in");
ofstream fout(FILE".out");
pair<int,int> heap[200005];
int n,x,op,size;
void urca(int x){
int pos = x;
while(pos > 0){
if(heap[pos/2].first > heap[pos].first){
swap(heap[pos/2],heap[pos]);
pos /= 2;
}
else{
break;
}
}
}
void coboara(int x){
int pos = x;
while(heap[2*pos+1].second != 0 && heap[2*pos].first > heap[pos].first || heap[2*pos+1].first > heap[pos].first){
urca(2*pos);
urca(2*pos+1);
}
urca(2*pos);
}
void insert(int x){
int pos = size+1;
pair<int,int> xp = {x, size+1};
heap[pos] = xp;
urca(pos);
}
void remove(int x){
int pos=0;
for(int i = 1; i <= size; ++i){
if(heap[i].second == x)
pos = i;
}
heap[pos] = heap[size];
urca(pos);
coboara(pos);
}
int main(){
fin >> n;
ios::sync_with_stdio(false);
for(int i = 0; i < n; ++i){
fin >> op;
switch (op){
case 1:
fin >> x;
insert(x);
size++;
break;
case 2:
fin >> x;
remove(x);
size--;
break;
case 3:
fout << heap[1].first << '\n';
break;
default:
break;
}
/*for(int i = 1; i <= size; ++i){
cout << heap[i].first << ' ';
}
cout << '\n';*/
}
}