mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 06:09:28 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
28 lines
584 B
Python
28 lines
584 B
Python
from bisect import bisect
|
|
from itertools import accumulate
|
|
|
|
|
|
def frac_knapsack(vl, wt, w, n):
|
|
"""
|
|
>>> frac_knapsack([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()
|