Pagini recente » Cod sursa (job #2369519) | Cod sursa (job #1223823) | Cod sursa (job #2485112) | Cod sursa (job #2784347) | Cod sursa (job #2704419)
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int> > o(5001);
int d[10001][5001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,g;
cin>>n>>g;
for(int i=0;i<n;++i) cin>>o[i].first>>o[i].second;
for(int i=1;i<=g;i++)
{
if(o[0].first<=i)
d[i][0]=o[0].second;
}
for(int j=1;j<n;j++)
{
for(int i=1;i<=g;i++)
{
if(o[j].first<=i)
{
if(d[i-o[j].first][j-1]+o[j].second>d[i][j-1])
{
d[i][j]=d[i-o[j].first][j-1]+o[j].second;
}
else d[i][j]=d[i][j-1];
}
}
}
cout<<d[g][n-1];
return 0;
}