Add 630_Course_Schedule_III.java

Author: Sean Prashad

Top K Elements/630_Course_Schedule_III.java

@@ -0,0 +1,18 @@
+class Solution {
+ public int scheduleCourse(int[][] courses) {
+ int n = courses.length;
+ if (n == 0)
+ return 0;
+ Arrays.sort(courses, (a, b) -> a[1] - b[1]);
+ PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b - a);
+ int start = 0;
+ for (int[] course : courses) {
+ start += course[0];
+ pq.offer(course[0]);
+ if (start > course[1]) {
+ start -= pq.poll();
+ }
+ }
+ return pq.size();
+ }
+}