Cod sursa(job #2279856)
Utilizator | Data | 10 noiembrie 2018 09:49:48 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int a[10005];
int n, g, m, p;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d", &n, &g);
for(int i=0;i<n;++i){
scanf("\n%d %d", &m, &p);
for(int j=g;j>=m;--j)
a[j] = max(a[j], p+a[j-m]);
}
cout<<a[g];
return 0;
}