Pagini recente » Cod sursa (job #1578346) | Cod sursa (job #2425215) | Cod sursa (job #3130884) | Cod sursa (job #959615) | Cod sursa (job #2505759)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,k,p[5001],g[5001],dp[10001];
int main()
{ in>>n>>k;
for(int i=1;i<=n;i++)
in>>g[i]>>p[i];
for(int i=1;i<=n;i++)
{ for(int j=k;j>0;j--)
{ if(j<g[i])
dp[j]=dp[j];
else
dp[j]=max(dp[j],dp[j-g[i]]+p[i]);
}
}
out<<dp[k];
in.close();
out.close();
return 0;
}