Function knapsack_limited

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

個数制限付きナップサック問題

Time complexity $O(n \cdot cap \log \max ms)$

Space complexity $O(cap)$