Added Solution - GfG to GitHub

Author: Sangram03

Difficulty: Medium/Job Sequencing Problem/job-sequencing-problem.java

@@ -0,0 +1,53 @@
+//{ Driver Code Starts
+// Initial Template for Java
+import java.util.*;
+
+
+// } Driver Code Ends
+
+class Solution {
+    public ArrayList<Integer> jobSequencing(int[] d, int[] p) {
+        int n = d.length, cnt = 0, tot = 0;
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+        List<int[]> jobs = new ArrayList<>();
+        
+        for (int i = 0; i < n; i++) jobs.add(new int[] {d[i], p[i]});
+        jobs.sort(Comparator.comparingInt(a -> a[0]));
+
+        for (int[] job : jobs) {
+            if (job[0] > pq.size()) pq.add(job[1]);
+            else if (pq.peek() < job[1]) { pq.poll(); pq.add(job[1]); }
+        }
+        
+        cnt = pq.size();
+        while (!pq.isEmpty()) tot += pq.poll();
+        
+        return new ArrayList<>(Arrays.asList(cnt, tot));
+    }
+}
+
+//{ Driver Code Starts.
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = Integer.parseInt(sc.nextLine().trim());
+
+        while (t-- > 0) {
+            String[] deadlineInput = sc.nextLine().trim().split("\\s+");
+            int[] deadline =
+                Arrays.stream(deadlineInput).mapToInt(Integer::parseInt).toArray();
+
+            String[] profitInput = sc.nextLine().trim().split("\\s+");
+            int[] profit =
+                Arrays.stream(profitInput).mapToInt(Integer::parseInt).toArray();
+            Solution obj = new Solution();
+            ArrayList<Integer> result = obj.jobSequencing(deadline, profit);
+            System.out.println(result.get(0) + " " + result.get(1));
+            System.out.println("~");
+        }
+
+        sc.close();
+    }
+}
+// } Driver Code Ends