You want to buy a new laptop and a new phone but you don't know how much to spend on each item. You have done your research and have quantified how happy you will be spending your money on each of the items. You know that if you spend i dollars on a laptop and dollars on a phone, your total happiness is a: + bj, for two non-decreasing sequences 20,21,...,n and bo, 61, ...,br that you have calculated. Given that you have a budget of k dollars, how should you spend your money? Your goal is now to calculate the maximum achievable happiness for some budget ke {0,...,n}, i.e. Ck = max EO,.....) + bk-. Before solving the problem, you observed that for some items the rate of increase in your happiness drops as you spend more money on the item. We call such a sequence s, concave, which means that s; - $i-1 > Si+1 - S, when 1