Node.js) 백준 16562번: 친구비

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

16562번: 친구비

class Node {
	constructor(item) {
		this.item = item;
		this.next = null;
	}
}

class Queue {
	constructor() {
		this.head = null;
		this.tail = null;
		this.length = 0;
	}

	push(item) {
		const node = new Node(item);
		if (this.head == null) {
			this.head = node;
		} else {
			this.tail.next = node;
		}

		this.tail = node;
		this.length += 1;
	}

	pop() {
		const popItem = this.head;
		this.head = this.head.next;
		this.length -= 1;
		return popItem.item;
	}
}

const input = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' ').map(Number));

// 학생수, 친구관계 수 , 가지고 있는돈
// 친구비
// 친구관게...

const [N, M, K] = input[0];
const cost = input[1];
cost.unshift(null);

const friendLink = Array.from(Array(N + 1), () => []);

for (let i = 2; i < input.length; i++) {
	const [x, y] = input[i];
	friendLink[x].push(y);
	friendLink[y].push(x);
}

const q = new Queue();

let visited = Array.from(Array(N + 1), () => false);

let need = 0;
for (let i = 1; i < N + 1; i++) {
	if (visited[i]) continue;
	q.push(i);
	visited[i] = true;
	let min = cost[i];
	while (q.length > 0) {
		const now = q.pop();
		const nowCost = cost[now];
		min = min > nowCost ? nowCost : min;
		const flist = friendLink[now];
		for (let f = 0; f < flist.length; f++) {
			const next = flist[f];
			if (visited[next]) continue;
			visited[next] = true;
			q.push(next);
		}
	}
	need += min;
}

console.log(need > K ? 'Oh no' : need);