문제

내 코드

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

let N = Number(input.shift());
let arr = input.map((v) => v.split(" ").map(Number));
let dp = Array.from({ length: N }, () => 1);
let answer = 0;

arr = arr.sort((a, b) => a[0] - b[0]);

for (let i = 1; i < N; i++) {
  count = 0;
  for (let j = 0; j < i; j++) {
    if (arr[i][1] > arr[j][1]) {
      dp[i] = Math.max(dp[i], dp[j] + 1);
    }
  }
}

answer = N - Math.max(...dp);
console.log(answer);

깃허브 링크

https://github.com/highjoon/Algorithm/blob/master/BOJ/2565.js