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