Cod sursa(job #1123695)
Utilizator | Data | 26 februarie 2014 09:42:04 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
long long n,m,i,j,a[5005],b[5005],c[10005],sol;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) f>>a[i]>>b[i];
for(i=1;i<=n;i++)
{
for(j=m;j>=a[i];j--)
{
c[j]=max(c[j],c[j-a[i]]+b[i]);
}
}
for(i=m;i>=1;i--) if(c[i]>sol) sol=c[i];
g<<sol;
return 0;
}