Pagini recente » Cod sursa (job #937681) | Cod sursa (job #649028) | Cod sursa (job #2428257) | Cod sursa (job #770324) | Cod sursa (job #3243535)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int g, n, i, j;
int dp[10005];
pair<int, int> v[5005];
int main()
{
fin>>n>>g;
for(i=1;i<=n;i++){
fin>>v[i].first>>v[i].second;
}
for(i=1;i<=n;i++){
for(j=g;j>=1;j--){
if(j>=v[i].first){
dp[j]=max(dp[j], dp[j-v[i].first]+v[i].second);
//cout<<dp[j]<<" ";
}
}
}
fout<<dp[g];
return 0;
}