Cod sursa(job #2119762)
Utilizator | Data | 1 februarie 2018 16:59:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w,p,a[5005][10005];
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>w>>p;
for(int j=1;j<=g;j++)
{
if(w>j) a[i][j]=a[i-1][j];
else a[i][j]=max(p+a[i-1][j-w],a[i-1][j]);
}
}
out<<a[n][g];
return 0;
}