Node.js) 백준 29723번: 브실이의 입시전략

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

29723번: 브실이의 입시전략

 

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

const [N, M, K] = NMK.split(' ').map(Number);

const subject = {};

for (let i = 0; i < N; i++) {
	const sugang = S[i].split(' ');
	const name = sugang[0];
	const score = +sugang[1];
	subject[name] = score;
}

let base = 0;
for (let i = 0; i < K; i++) {
	const public = S[N + i];
	base += subject[public];
	delete subject[public];
}

const private = Object.values(subject).sort((a, b) => a - b);

let min = base;
let max = base;

for (let i = 0; i < M - K; i++) {
	min += private[i];
	max += private[private.length - 1 - i];
}

console.log(min, max);