mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
27 lines
581 B
Python
27 lines
581 B
Python
from itertools import accumulate
|
|
from bisect import bisect
|
|
|
|
|
|
def fracKnapsack(vl, wt, W, n):
|
|
"""
|
|
>>> fracKnapsack([60, 100, 120], [10, 20, 30], 50, 3)
|
|
240.0
|
|
"""
|
|
|
|
r = list(sorted(zip(vl, wt), key=lambda x: x[0] / x[1], reverse=True))
|
|
vl, wt = [i[0] for i in r], [i[1] for i in r]
|
|
acc = list(accumulate(wt))
|
|
k = bisect(acc, W)
|
|
return (
|
|
0
|
|
if k == 0
|
|
else sum(vl[:k]) + (W - acc[k - 1]) * (vl[k]) / (wt[k])
|
|
if k != n
|
|
else sum(vl[:k])
|
|
)
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|