Problem 1843. Optimally fill a container with elements of different sizes

Created by HH

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a row vector V of different numerical values and a size limit L, return a 1x2 vector A, containing (a) the largest sum of any subset of elements in the input vector V, which is lower than or equal to the size limit, and (b) the number of different possible subsets of V with which this sum can be obtained.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Note that two or more elements in V may have the same value and will be considered as two different possibilities.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Example 1:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input V = [ 4 2 6 3 6 ]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input L = 11</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Output A = [ 11 2 ]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The size limit of 11 can be obtained (exactly, in this case) by adding 2, 3 and 6 together, but there are two different elements with the value of 6 and, therefore, two possible subsets of V satisfying the condition.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Example 2:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input V = [ 1.1 1.3 0.6 0.9 ]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input L = 2.5</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Output A = [ 2.4 1 ]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The sum of 2.4, which is the highest sum of any subset of V that does not exceed L, can be obtained in only one way.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

35 Solutions
17 Solvers

Last Solution submitted on Dec 27, 2020

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Problem Tags

optimization

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1843. Optimally fill a container with elements of different sizes

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Suggested Problems

More from this Author34

Problem Tags

Community Treasure Hunt

Problem 1843. Optimally fill a container with elements of different sizes

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers17

Suggested Problems

More from this Author34

Problem Tags

Community Treasure Hunt

Players