Anonymous user
Knapsack problem/Continuous: Difference between revisions
→{{header|Haskell}}
(Updated D entry) |
|||
Line 556:
where a = floor q
b = q - toEnum a</lang>
Or similar to above (but more succinct):
<lang haskell>
import Data.List (sortBy)
import Data.Ord (comparing)
import Text.Printf (printf)
-- (name, (value, weight))
items = [("beef", (36, 3.8)),
("pork", (43, 5.4)),
("ham", (90, 3.6)),
("greaves", (45, 2.4)),
("flitch", (30, 4.0)),
("brawn", (56, 2.5)),
("welt", (67, 3.7)),
("salami", (95, 3.0)),
("sausage", (98, 5.9))]
unitWeight (_, (val, weight)) = (fromIntegral val) / weight
solution k = loop k . sortBy (flip $ comparing unitWeight)
where loop k ((name, (_, weight)):xs)
| weight < k = ["Take all the " ++ name] ++ loop (k-weight) xs
| otherwise = [printf "Take %.2f kg of the %s" (k :: Float) name]
main = mapM_ putStrLn $ solution 15 items
</lang>
=={{header|Icon}} and {{header|Unicon}}==
| |||