Cod sursa(job #1497736)
Utilizator | Data | 7 octombrie 2015 11:16:47 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int a[50][50];
int main()
{
int n,G,x,val;
f>>n>>G;
for(int i=1; i<=n; i++)
{
f>>x>>val;
for(int j=1;j<=G;j++){
if(j>=x)
a[i][j]= max(a[i-1][j], a[i-1][j-x]+val);
else
a[i][j]=a[i-1][j];
}
}
g<<a[n][G];
return 0;
}