I have to find a dynamic programming algorithm that solves the following problem, and I seem to be stuck:
There is a set of article, each of them with a
