Fractional Knapsack

Medium Greedy Scheduling

Log in to solve

Items can be split. Given values, weights and capacity W, print the maximum total value with two decimals.

Constraints

1 <= n <= 10^5

No discussions yet.