I am a little confused about the second base case.
In knapsack problem, the base case for both i and j is equal to 0.
However, here we are saying when j==0 dp[i][j]=INT_MAX;
Is the reason that when we have no dishes. It is impossible to feed all the guests