# Fractional Knapsack - Official

#### Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

`1. You are given a number n, representing the count of items.2. You are given n numbers, representing the values of n items.3. You are given n numbers, representing the weights of n items.3. You are given a number "cap", which is the capacity of a bag you've.4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity.Note1 -> Items can be added to the bag even partially. But you are not allowed to put same items again and again to the bag.`
Input Format
`A number nv1 v2 .. n number of elementsw1 w2 .. n number of elementsA number cap`
Output Format
`A decimal number representing the maximum value that can be created in the bag without overflowing it's capacity`
Question Video
Constraints
`1 <= n <= 200 <= v1, v2, .. n elements <= 500 < w1, w2, .. n elements <= 100 < cap <= 10`
Sample Input
`1033 14 50 9 8 11 6 40 2 15 7 2 5 9 3 2 1 10 3 3 5`
Sample Output
`50.0`

• Asked in Companies
• Related Topics

Run

Run
Id Name