Cod sursa(job #1151765)
Utilizator | Data | 24 martie 2014 12:49:32 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
long long n,m,i,j,a,b,c[10005],rez;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>a>>b;
for(j=m;j>=a;j--)
{
{
c[j]=max(c[j],c[j-a]+b);
}
}
}
for(i=m;i>=1;i--) if(c[i]>rez) rez=c[i];
g<<rez;
return 0;
}