0/1 Knapsack Problem

You are given `n` items, each having a weight and a value. You are also given a knapsack of maximum capacity `W`. Find the maximum total value of items that can be packed into the knapsack without exceeding its capacity `W`. You cannot break items; each item can either be taken or left. ### Constraints - `1 <= n <= 1000` - `1 <= W <= 1000` - `1 <= weights[i], values[i] <= 1000` ### Input Format - Line 1: An integer `W` (capacity). - Line 2: Space-separated integers representing `weights`. - Line 3: Space-separated integers representing `values`. ### Output Format Print the maximum value attainable.