Node.js) 백준 2565번 : 전깃줄 ★

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

2565번: 전깃줄

const fs = require('fs');
const [n, ...arr] = fs.readFileSync("./dev/stdin").toString().trim().split("\n");


const powerCode = arr.map(v=>v.split(' ')).sort((a,b)=>{ return a[0]-b[0]}).map(v=>+v[1])

function dpLis(arr){
    let lis = [];
    for(let i = 0; i<arr.length; i++){
        lis[i] = 1;
        for(let j=0; j<i; j++){
            if(arr[j]<arr[i]){
                lis[i] = Math.max(lis[i],lis[j]+1);
            }
        }
    }

    return Math.max(...lis)
}


const answer = powerCode.length-dpLis(powerCode);

console.log(answer);