Pagini recente » Cod sursa (job #1869787) | Cod sursa (job #322991) | Cod sursa (job #1182899) | Cod sursa (job #5861) | Cod sursa (job #1699858)
#include <fstream>
#define NM 5005
using namespace std;
int d[NM][NM];
int gr[NM], p[NM], n, m;
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f >> n >> m;
for(int i = 1; i <= n; ++i)
f >> gr[i] >> p[i];
for(int i = 1; i <= n; ++i)
{
for(int j = 0; j <= m; ++j)
{
d[i][j] = d[i-1][j];
if(gr[i] <= j)
d[i][j] = max(d[i][j], d[i-1][j-gr[i]]+p[i]);
}
}
g << d[n][m];
}