A robot goes from terminal to terminal collecting bolts. The robot needs to collect at least $m$ bolts and there are $n$ terminals. Terminal $i$ gives the robot a certain number of bolts denoted by $b_i$, however the robot has to wait time $w_i$ at a terminal before the bolts are dispensed. The robot needs to collect the bolts in the minimum amount of big-$O$ time.
I'm having a great amount of difficulty figuring out what exactly it means to produce a
dynamic programming solution to a simple problem like this.
Can anyone start me off in the right direction?