Can anybody help me find a way to solve the problem
Problem
You are asked to assign m of the programmers among n projects. Assume that all of the programmers are equally competent.
You have figured out how much benefit i programmers will bring to project j. View this benefit as a number. Formally put, for each project j, you have computed an array Aj[0..m] where Aj is the benefit obtained by assigning i programmers to project j. Assume
that Aj is nondecreasing with increasing i. Further make the economically sound assumption that the marginal benefit obtained by assigning an ith programmer to a project is nonincreasing as i increases. Thus, for all j and i >= 1, Aj - Aj <= Aj - Aj .
Design a greedy algorithm to determine how many programmers you will assign to each project such that the total benefit obtained over all projects is maximized.