1 solutions

  • 0
    @ 2023-12-3 21:35:24

    C++ :

    #include<cstdio>
    #include<iostream>
    using namespace std;
    const int mm=13333;
    int f[mm],w[mm],d[mm];
    int i,j,k,n,m;
    int main()
    {
        //freopen("beibao0.in","r",stdin);
    	//freopen("beibao0.out","w",stdout);
        while(scanf("%d%d",&n,&m)!=-1)
        {
            for(i=0;i<n;++i)scanf("%d%d",&w[i],&d[i]);
            for(i=0;i<m;++i)f[i]=0;
            for(i=0;i<n;++i)
                for(j=m;j>=w[i];--j)f[j]=max(f[j],f[j-w[i]]+d[i]);
            printf("%d\n",f[m]);
        }
        return 0;
    }
    
    
    • 1

    Information

    ID
    1317
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By