Lua装载问题：容量上限的价值最大化

local function pack2D(w, v, cap)
    local f = {}
    for i = 0, #w do f[i] = {} end
    for i = 1, #w do
        for j = 0, cap do
            f[i][j] = (f[i - 1] or {})[j] or 0
            if j >= w[i] then
                local take = (f[i - 1][j - w[i]] or 0) + v[i]
                if take > f[i][j] then f[i][j] = take end
            end
        end
    end
    return f[#w][cap]
end

local function pack1D(w, v, cap)
    local f = {}
    for j = 0, cap do f[j] = 0 end
    for i = 1, #w do
        for j = cap, w[i], -1 do
            f[j] = math.max(f[j], f[j - w[i]] + v[i])
        end
    end
    return f[cap]
end
local p = getplayerbyname("cargo01")
sendmsg(p, 1, "最高价值 " .. pack1D({5, 8, 9}, {10, 16, 18}, 20))