Node.js)백준 14501번: 퇴사

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

14501번: 퇴사

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v=>v.split(' ').map(Number));
const [N] = input[0]
const consult = input.splice(1);
let answer = 0;


function maxPrice(t,p){
  let end = true;
  for(let i = 0; i<consult.length; i++){
    if(i+1>=t && consult[i][0]+i<=N){
      maxPrice(consult[i][0]+i+1,p+consult[i][1])
      end = false;
    }
  }

  if(end){
    if(p>answer){
      answer = p
    }
    return;
  }
}

maxPrice(0,0)

console.log(answer)