Pagini recente » Cod sursa (job #1348920) | Cod sursa (job #395913) | Cod sursa (job #1105497) | Cod sursa (job #958118) | Cod sursa (job #2716111)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout("rucsac.out");
int n,G,w[5009],p[5009];
int dp[10009];
int32_t main()
{
fin>>n>>G;
for(int i=1;i<=n;i++)
fin>>w[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=G;j>=0;j--){
if(w[i]<=j)
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
else
dp[j]=dp[j];
}
fout<<dp[G];
}