Function knapsack_small_weight

pub fn knapsack_small_weight<T>(cap: usize, ws: &[usize], vs: &[T]) -> T
where
    T: Copy + Ord + Add<Output = T> + Zero,

容量が小さいナップサック問題

Time complexity $O(n \cdot cap)$

Space complexity $O(cap)$