3647. Maximum Weight in Two Bags

Use dynamic programming.

Let dp[i][j] be the maximum total weight that can be held in the two bags when their current weights (or used capacities) are i and j, respectively.