Pagini recente » Cod sursa (job #1359371) | Cod sursa (job #3216178) | Cod sursa (job #2896519) | Cod sursa (job #2576123) | Cod sursa (job #1051481)
#include <cstdio>
#define N 5010
#define G 10010
int a[N][G];
int g[N];
int p[N];
#define max2 (x,y) ((x>y)?x:y)
#define maxim (x , y , z) (max2 (x , max2 (y , z)))
int max (int x , int y)
{
if (x > y)
return x;
return y;
}
int main()
{
freopen ("rucsac.in" , "r" , stdin);
freopen ("rucsac.out" , "w" , stdout);
int n , gmax;
scanf ("%d %d\n" , &n , &gmax);
for (int i = 1 ; i <= n ; ++i)
{
int x , y;
scanf ("%d %d" , &x , &y);
g[i] = x;
p[i] = y;
}
for (int i = 1 ; i <= n ; ++i)
{
for (int j = 0 ; j <= gmax ; ++j)
{
a[i][j] = a[i - 1][j];
if (j >= g[i] )
a[i][j] = max (a[i - 1][j] ,p[i] + a[i - 1][j - g[i]]);
}
}
printf ("%d\n" , a[n][gmax]);
/* for (int i = 1 ; i <= n ; ++i)
{
for (int j = 1 ; j <= gmax ; ++j)
printf("%d " , a[i][j]);
printf ("\n");
}*/
return 0;
}