title: Knapsack with continuous (non distinct) constraint
body: <p>I watched <a href="http://www.youtube.com/watch?v=hugQNiYoqUA&amp;feature=related" rel="noreferrer">Dynamic Programming - Kapsack Problem (YouTube)</a>. However, I am solving a slightly different problem where the constraint is the budget, price, in double, not integer. So I am wondering how can I modify that? Double is "continuous" unlike integer where I can have 1,2,3 .... I don't suppose I do 0.0, 0.1, 0.2 ...?</p>
  
  <p><strong>UPDATE 1</strong></p>
  
  <p>I thought of converting double to int by multiply by 100. Money is only 2 decimal places. But that will mean the range of values will be very large?</p>
  
  <p><strong>UPDATE 2</strong></p>
  
  <p>The problem I need to solve is: </p>
  
  <blockquote>
    <p>Items have a price (double) &amp; satisfaction (integer) value. I have a budget as a constraint and I need to maximize satisfaction value. </p>
    
    <p>In the youtube video, the author created two 2d array like int[numItems][possibleCapacity(weight)]. Here, I can't as budget is a double not integer</p>
  </blockquote>