C语言代码，背包问题

#include<stdio.h>

#include<stdlib.h>

typedef struct Holl{

    int time;

    int value;

}Holl;

Holl* hollCaoyao(int num){

    Holl* holl = (Holl*)malloc(sizeof(Holl)*(num+1));

    for(int i = 1; i <= num; i++){

        int time, value;

        scanf("%d %d", &time, &value);

        holl[i].time = time;

        holl[i].value = value;

    }

    holl[0].time = 0;

    holl[0].value = 0;

    return holl;

}

int main()

{

    int T,M;

    scanf("%d %d", &T, &M);

    Holl* holl = hollCaoyao(M);

    int** dp = (int**)malloc(sizeof(int*)*(M+1));

    for(int i = 0; i <= M; i++){

        dp[i] = (int*)malloc(sizeof(int)*(T+1));

    }

    for(int i = 0; i <= M; i++){

        for(int j = 0; j <= T; j++){

            dp[i][j] = 0;

        }

    }

    for(int i = 1; i <= M; i++){

        for(int j = 1; j <= T; j++){

            if(holl[i].time <= j){

                if((holl[i].value+dp[i-1][j-holl[i].time])>dp[i-1][j]){

                    dp[i][j] = holl[i].value+dp[i-1][j-holl[i].time];

                }

                else{

                    dp[i][j] = dp[i-1][j];

                }

            }

            else{

                dp[i][j] = dp[i-1][j];

            }

        }

    }

    int max = 0;

    for(int i = 0; i <= M; i++){

        for(int j = 0; j <= T; j++){

            //printf("%d ", dp[i][j]);

            if(max<dp[i][j]){

                max = dp[i][j];

            }

        }

        //putchar('\n');

    }

    printf("%d", max);

    return 0;

}