56pts，求调T_T

#include<bits/stdc++.h>
using namespace std;

int dp[12881]={  0  };
int priceC[401];
int sizeC[401];

int main(){
    int Ncount = 0,Msize = 0,maxsize = 0,maxprice=0;
    cin >> Ncount >> Msize;
    for (int i = 1;i<=Ncount;i++)
    {
        cin >> sizeC[i] >> priceC[i];
        maxsize+=sizeC[i];
        maxprice+=priceC[i];
    }
    if (Msize>=maxsize){
        cout << maxprice;
        return 0;
    }
    
    for (int items = 1;items<=Ncount;items++){
        for (int size = Msize;size>=sizeC[items];size--){
            
                dp[size] = max(
                    dp[size],
                    dp[size - sizeC[items]] + priceC[items]
                );
        }
    }
    // for (int size = 1;size<=Msize;size++){
    //     for (int items = 1;items<=Ncount;items++){
    //         printf("%d ",dp[items][size]);
 
    //     }
    //     printf("\n");
    // }
    printf("%d",dp[Msize]);
    return 0;
}