Cod sursa(job #1786025)
| Utilizator | Data | 22 octombrie 2016 11:31:53 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 10005
using namespace std;
int n, g_max, vec[N];
void citire()
{
scanf("%d %d\n",&n,&g_max);
int x,y;
for(int i = 0 ; i < n ; ++i)
{
scanf("%d %d\n",&x,&y);
for(int j = g_max ; j >= x ; --j)
{
vec[j] = max(vec[j],vec[j - x] + y);
}
}
printf("%d",vec[g_max]);
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
citire();
return 0;
}
