Arnhav's Cake Problem I

Arnhav has opened a bakery which has become very popular. Many people have placed orders for cakes and he has a hard time deciding his schedule. Arnhav lists $k$ scheduled orders for the next $N$ days. Each order has its own deadline and a value. Each order can be completed within a day irrespective of how many orders he does that day.He does not want to over work, so he places a bound, $o$$i$, t