Cod sursa(job #3130161)

Utilizator PatrunjelxdVarona Antoniu Patrunjelxd Data 16 mai 2023 22:57:49
Problema Heapuri Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

int a;
int v[200003], Heap[200003], Pos[200003];

void push(int x)
{
	int aux;
	while (x/2 && v[Heap[x]]<v[Heap[x/2]])
	{
		aux = Heap[x];
		Heap[x] = Heap[x/2];
		Heap[x/2] = aux;

		Pos[Heap[x]] = x;
		Pos[Heap[x/2]] = x/2;
		x /= 2;
	}
}

void pop(int x)
{
	int aux, y = 0;
	while (x != y)
	{
		y = x;
		if (y*2<=a && v[Heap[x]]>v[Heap[y*2]]) x = y*2;
		if (y*2+1<=a && v[Heap[x]]>v[Heap[y*2+1]]) x = y*2+1;
		aux = Heap[x];
		Heap[x] = Heap[y];
		Heap[y] = aux;
		Pos[Heap[x]] = x;
		Pos[Heap[y]] = y;
	}
}

int main()
{
    int n, nr = 0;
	int x, cod;
	fin >> n;
	for (int i=0; i<n; i++)
	{
		fin >> cod;
		if (cod == 1)
		{
            fin >> x;
			a++, nr++;
			v[nr] = x;
			Heap[a] = nr;
			Pos[nr] = a;
			push(a);
		}
		if (cod == 2)
		{
            fin >> x;
			v[x] = -1;
			push(Pos[x]);
			Pos[Heap[1]] = 0;
			Heap[1] = Heap[a--];
			Pos[Heap[1]] = 1;
			if (a>1) pop(1);
		}
		if (cod == 3) fout << v[Heap[1]] << endl;
	}

	return 0;
}