#include "jelly.h" #include <cstdio> #include <cassert> #include <vector> #include<bits/stdc++.h> using namespace std; int find_maximum_unique(int x, int y, std::vector<int> arr, std::vector<int> brr) { int n = arr.size(); int dp [n+1][x+1][y+1]; memset(dp,0,sizeof dp); for (int i =1;i<=n;++i){ for (int j =0;j<=x;++j){ if (j-arr[i-1]==0)continue; for (int k =0;k<=y;++k){ dp[i][j][k] = max({(j-arr[i-1]>=0)?dp[i-1][j-arr[i-1]][k]+1:0,(k-brr[i-1]>=0)?dp[i-1][j][k-brr[i-1]]+1:0,dp[i-1][j][k],dp[i][j][k]}); } } } return dp[n][x][y]; }