Pagini recente » Cod sursa (job #606250) | Cod sursa (job #1218057) | Istoria paginii runda/simulare9_31_10/clasament | Cod sursa (job #1250650) | Cod sursa (job #2479708)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,m,dp[10005],w[5005],p[5005];
int main() {
cin>>n>>m;
for(int i=1;i<=n;i++) {
cin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++) {
for(int j=m;j>=1;j--) {
if (w[i]<=j )
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
}
}
cout<<dp[m];
return 0;
}