diff --git a/15_Greedy/JobSequencing.java b/15_Greedy/JobSequencing.java
index 0d251e4..5bf332c 100644
--- a/15_Greedy/JobSequencing.java
+++ b/15_Greedy/JobSequencing.java
@@ -14,25 +14,41 @@ public Job(int id, int deadline, int profit) {
     }
 
     public static void main(String args[]) {
-        int jobsInfo[][] = {{4, 20}, {1, 10}, {1, 40}, {1, 30}};
+        int jobsInfo[][] = {{4, 60}, {1, 10}, {1, 40}, {1, 30}};
         ArrayList<Job> jobs = new ArrayList<>();
-
-        for(int i=0; i<jobsInfo.length; i++) {
+        
+        int maxtime=0;
+        
+        for(int i=0; i<jobsInfo.length; i++) { 
             jobs.add(new Job(i, jobsInfo[i][0], jobsInfo[i][1]));
+            maxtime=Math.max(maxtime, jobsInfo[i][0]);
         }
 
         Collections.sort(jobs, (a, b) -> b.profit - a.profit);
+        
+        boolean slot[]=new boolean[maxtime+1];
+        for(int i=0;i<=maxtime;i++){
+            slot[i]=false;
+           
+        }
+        
         ArrayList<Integer> ans = new ArrayList<>();
         
-        ans.add(jobs.get(0).id);
-        int time = 1;
-        for(int i=1; i<jobs.size(); i++) {
+        int count=0;
+       
+        for(int i=0; i<jobs.size(); i++) {
             Job j = jobs.get(i);
-            if(time < j.deadline) {
-                ans.add(j.id);
-                time++;
-            }
+            for(int k=j.deadline;k>0;k--) {
+                if(slot[k]==false) {
+                    slot[k]=true;
+                    ans.add(j.id);
+                    count++;
+                    break;
+                }
+            }  
         }
+        
+        System.out.println("No. of jobs to be done="+count);
 
         for(int i=0; i<ans.size(); i++) {
             System.out.print(ans.get(i)+" ");