[백준 11000번] 그리디 알고리즘 - 강의실 배정

✨ 문제 ✨

✨ 정답 ✨

const { count } = require("console");
const fs = require("fs");
const { nextTick } = require("process");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./예제.txt";
let input = fs.readFileSync(filePath).toString().trim();


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

input=input.split('\n')
let n=+input.shift()

let times=input.map((el)=>el.split(' ').map(el2=>+el2))
const solution=(n, times)=>{
  let answer=0;
  let classroom=0;
  const obj=[];
  for (let i=0;i<n;i++){
    obj.push({time:times[i][0], start:1});
    obj.push({time:times[i][1], start : -1});
  }
  obj.sort((a,b)=>a.time===b.time?a.start-b.start:a.time-b.time);
  obj.forEach(schedule=>{
    if (schedule.start===-1){
      classroom-=1;
    }else if (schedule.start===1){
      classroom+=1;
    }
    answer=classroom>answer?classroom:answer;
  })
  return answer;
}

const answer=solution(n, times);
console.log(answer)

🧵 참고한 정답지 🧵

https://junghyeonsu.tistory.com/275

💡💡 기억해야 할 점 💡💡