Cod sursa(job #1123678)
Utilizator | Data | 26 februarie 2014 09:38:10 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,i,j,a[5005],b[5005],c[5005],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]);
sol=max(sol,c[j]);
}
}
g<<sol;
return 0;
}