Java: Job Sequencing Problem

Problem Statement:

Given an array of jobs where every job has a deadline and associated profit if the job is finished

before the deadline. It is also given that every job takes a single unit of time, so the minimum

possible deadline for any job is 1. Maximize the total profit if only one job can be scheduled at

a time..

Example

Input:

Four Jobs with following deadlines and profits
JobID Deadline Profit
a     4     20
b     1     10
c     1     40
d     1     30

Following is maximum profit sequence of jobs: c, a