Cod sursa(job #1917963)
Utilizator | Data | 9 martie 2017 13:43:41 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,i,s,dp[10001],cst[10001],val,x,j;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d%d",&x,&val);
for(j=m;j>=x;j--)
dp[j]=max(dp[j-x]+val,dp[j]);
}
printf("%d",dp[m]);
return 0;
}