Notes

#include <bits/stdc++.h>

using namespace std;

int max(int a,int b)
{
if(a>b) return a;
else return b;
}

long buyMaximumProducts(int n, long k, vector <int> a) {
int dp[n+1][k+1];
for(int i=0;i<=n;i++) dp[i][0]=0;
for(int i=0;i<=k;i++) dp[0][i]=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=k;j++)
{
int limit = a[i-1]*i;
if(j>=a[i-1]) {dp[i][j]=max(dp[i-1][j],max(dp[i-1][j-a[i-1]],dp[i][j-a[i-1]])+1);} //atleast one transaction ith day
else dp[i][j]=dp[i-1][j]; //no transaction at ith day
}
}
for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++)
cout<<dp[i][j]<<" ";
cout<<endl;
}
return dp[n][k];
}

int main() {
int n;
cin >> n;
vector<int> arr(n);
for(int arr_i = 0; arr_i < n; arr_i++){
cin >> arr[arr_i];
}
long k;
cin >> k;
long result = buyMaximumProducts(n, k, arr);
cout << result << endl;
return 0;
}