Node.js) 백준 29755번: 블랙홀과 소행성

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

29755번: 블랙홀과 소행성

const [[N, M], _B, ...AW] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.trim().split(' ').map(Number));

const B = _B.sort((a, b) => a - b);

let answer = 0;

AW.forEach((v) => {
	const [a, w] = v;
	let left = 0;
	let right = N - 1;

	while (left <= right) {
		const mid = Math.floor((left + right) / 2);
		const target = B[mid];
		if (target == a) {
			break;
		} else if (target < a) {
			left = mid + 1;
		} else if (target > a) {
			right = mid - 1;
		}
	}
	let near = Infinity;
	const lastCheck = Math.floor((left + right) / 2);
	for (let i = lastCheck - 1; i <= lastCheck + 1; i++) {
		if (i >= 0 && i < N) {
			near = Math.min(near, Math.abs(B[i] - a));
		}
	}
	answer = Math.max(answer, near * w);
});

console.log(answer);