C语言背包问题优化[通俗易懂]

#include<stdio.h> 
#define V 1500 
int f[V]; 
int weight[10];  
int value[10];  
#define max(x,y) (x)>(y)?(x):(y) 
int main()  
{    
    int N, M;  
    scanf("%d %d", &N, &M);
    for (int i=1; i<=N; i++)  
    {  
        scanf("%d %d", &weight[i], &value[i]);  
    }   
    for (int i=1; i<=N; i++)  
        for (int j=M; j>=1; j--)  
        {  
            if (weight[i] <= j)  
            {  
                f[j] = max(f[j],f[j-weight[i]] + value[i]);  
            }             
        }  
    printf("%d\n", f[M]);    
    return 0;
}