Cod sursa(job #1510510)
Utilizator | Data | 25 octombrie 2015 10:02:21 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
#define DM 10003
using namespace std;
fstream fin("rucsac.in",ios::in),fout("rucsac.out",ios::out);
int x[DM];
int main()
{
int i,n,g,a,b,j;
fin>>n>>g;
for(i=1;i<=n;i++)
{
fin>>a>>b;
for(j=g;j>=a;j--)
{
x[j]=max(x[j],x[j-a]+b);
}
}
fout<<x[g];
return 0;
}