1 solutions

  • 1
    @ 2026-2-11 23:45:53

    #include<bits/stdc++.h> using namespace std; int W,n; int w[35],v[35]; int dp[205]; int main() { cin>>W>>n; int i,j,k; for(i=1;i<=n;i++) { cin>>w[i]>>v[i]; } for(i=1;i<=n;i++) { for(j=W;j>=w[i];j--) { for(k=1;k<=j/w[i];k++) { dp[j]=max(dp[j],dp[j-kw[i]]+kv[i]); } } } cout<<"max="<<dp[W]; return 0; } 仅供参考不要抄袭

    Information

    ID
    1240
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    7
    Tags
    # Submissions
    38
    Accepted
    10
    Uploaded By