Doubt in base case


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


If we do not have any dishes, we cannot fulfill hunger. But, in question it is mentioned that such a case would not be possible, so we put INT_MAX so that, this case where dishes is 0 and hunger still alive, should not exist in answer!