Cod sursa(job #972412)
Utilizator | Paval Ambrozie Nectar | Data | 11 iulie 2013 17:22:52 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<iostream>
using namespace std;
int n,g,w[100],p[100],a[100][100];
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>w[i]>>p[i];
}
in.close();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j-w[i] >= 0)
{
a[i][j]=max(a[i-1][j], a[i-1][j-w[i]]+p[i]);
}
else
a[i][j]=a[i-1][j];
}
}
out<<a[n][g];
return 0;
}