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