Node.js) 백준 22252번: 정보 상인 호석

https://www.acmicpc.net/problem/22252

22252번: 정보 상인 호석

class MaxHeap {
	constructor() {
		this.heap = [];
	}
	swap(a, b) {
		[this.heap[a], this.heap[b]] = [this.heap[b], this.heap[a]];
	}

	size() {
		return this.heap.length;
	}

	push(value) {
		this.heap.push(value);
		let current = this.heap.length - 1;
		let parent = Math.floor((current - 1) / 2);

		while (this.heap[parent] < value) {
			this.swap(parent, current);
			current = parent;
			parent = Math.floor((current - 1) / 2);
		}
	}

	pop() {
		const last = this.heap.length - 1;
		let current = 0;
		this.swap(current, last); // 0번이 루트노드
		const value = this.heap.pop();

		while (current < last) {
			let left = current * 2 + 1;
			let right = current * 2 + 2;

			if (left >= last) {
				break;
			} else if (right >= last) {
				if (this.heap[current] < this.heap[left]) {
					this.swap(current, left);
					current = left;
				} else {
					break;
				}
			} else {
				if (this.heap[left] > this.heap[current] || this.heap[right] > this.heap[current]) {
					let next = this.heap[left] > this.heap[right] ? left : right;
					this.swap(current, next);
					current = next;
				} else {
					break;
				}
			}
		}
		return value;
	}
}

const [Q, ...queries] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' '));

const gorilla = new Map();
let cost = 0;

queries.forEach((query) => {
	const [cmd, name, ...info] = query;
	switch (cmd) {
		case '1':
			const k = +info.shift();
			const maxheap = gorilla.has(name) ? gorilla.get(name) : new MaxHeap();
			for (let i = 0; i < k; i++) {
				maxheap.push(+info[i]);
			}
			gorilla.set(name, maxheap);
			break;
		case '2':
			if (!gorilla.has(name)) break;
			const b = +info[0];
			const g = gorilla.get(name);
			for (let i = 0; i < b; i++) {
				if (g.size() == 0) {
					break;
				} else {
					cost += g.pop();
				}
			}
			break;
	}
});
console.log(cost);