title: Algorithm for Filling bag maximally (this is not the knapsack 0/1)
body: <p>I am working on some task which requires from me to solve the following algorithmic problem:
  <hr>
  - You Have collection of items (their weights): [w1, w2, ..., wn]<br>
  - And You have a bag which weight is: W<br>
  - It is Needed to fill the bag maximally (fill as much as possible) with the subset of given items.<hr></p>
  
  <p>So this <strong>is not</strong> "Knapsack 0/1" problem, as we deal only with weights (we have only one parameter for item). Therefore I assume that it might have a solution (Knapsack is NP-complete) or some kind of algorithm which gives approximately correct result.</p>
  
  <p>Please don't suggest me "greedy algorithms", because I believe that there should be an algorithm which gives better results. I think that it should be an algorithm which uses "dynamic programming".</p>
  
  <p>Thank you in advance :)</p>