HDU 1114 - Piggy-Bank
Problem : N types of coin, each has value a[i] and weight b[i]. Find the minimum total value that weight m.
Solution : Let f[i][j] to be the first i-type coin weights j's minimum value. Then f[i][j]=min(f[i-1][j], f[i][j-b[i]]+a[i]).