Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
49052 | hanxizhe | 完全背包问题 | C++ | Accepted | 1 MS | 248 KB | 339 | 2024-06-16 16:22:44 |
#include<bits/stdc++.h> using namespace std; int m,n; int a[35],c[35],f[35]; void z(int cost,int w){ for(int v= w;v<=m;v++){ f[v] = max(f[v],f[v-w]+cost); } } int main(){ cin>>m>>n; for(int i = 1;i<=n;i++){ cin>>a[i]>>c[i]; } for(int i = 1;i<=n;i++){ z(c[i],a[i]); } cout<<"max="<<f[m]<<endl; return 0; }