data structure
-
[Greedy] 문제 이름 : University Career Fair - 사용자 정의 클래스 객체 정렬Algorithm/HackerRank 2021. 7. 30. 11:07
문제 설명 A team organizing a university career fair has a list of companies along with their respective arrival times and their duration of stay. Only one company can present at any time. Given each company's arrival time and the duration they will stay, determine the maximum number of presentations that can be hosted during the career fair. 사용 개념 그리디, 객체 정렬 문제 해결 아이디어 주어진 시간동안 최대한 많은 발표를 해야하므로 그리디..