Run ID Author Problem Lang Verdict Score Time Memory Code Length Submit Time
78812 Jαγ 简单背包问题2 C++ Accepted 100 0 MS 400 KB 454 2023-05-25 13:55:44

Tests(5/5):


#include<iostream> #include<cstdio> using namespace std; const int maxm=20005,maxn=20005; int m,n; int w[maxn],c[maxn]; int f[maxm]; int main() { cin>>m>>n; for(int i=1;i<=n;i++) { cin>>w[i]; c[i]=w[i]; } for(int i=1;i<=n;i++) { for(int v=m;v>=w[i];v--) { if(f[v-w[i]]+c[i]>f[v]) { f[v]=f[v-w[i]]+c[i]; } } } cout<<m-f[m]<<endl; return 0; }


Judgement Protocol: