Node.js)백준 19942번: 다이어트

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

19942번: 다이어트

 

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n");

function main(input) {
  const N = +input.shift()
  const food = input.map(v => v.split(' ').map(Number))
  const [mp, mf, ms, mv] = food.shift()
  let answer = Infinity;
  let selectedFoods = [];
  for (let k = 1; k < (1 << N); k++) {
    let p = 0;
    let f = 0;
    let s = 0;
    let v = 0;
    let cost = 0;

    let temp = []
    for (let i = 0; i < N; i++) {
      if (k & (1 << i)) {
        p += food[i][0]
        f += food[i][1]
        s += food[i][2]
        v += food[i][3]
        cost += food[i][4]
        temp.push({ index: i + 1, cost: food[i][4] })
      }
    }

    if (p >= mp && f >= mf && s >= ms && v >= mv) {
      if (cost <= answer) {
        if (cost < answer) selectedFoods = [];
        answer = cost
        const f = temp.sort((a, b) => {
          a.cost - b.cost
        }).map(v => v.index).join(' ')
        selectedFoods.push(f);
      };
    }
  }

  if (answer == Infinity) {
    console.log(-1)
  } else {
    console.log(answer)
    console.log(selectedFoods.sort()[0])
  }
}


main(input);