Cod sursa(job #1909581)
| Utilizator | Data | 7 martie 2017 13:10:49 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,tw,w[5001],v[5001],i;
void solve()
{
int i,j;
long dp[tw+1],dp1[tw+1];
dp[0]=0;
for(i=1;i<w[1];i++)dp[i]=0;
for(;i<=tw;i++)dp[i]=1;
for(i=1;i<=tw;i++)dp1[i]=dp[i];
for(i=2;i<=n;i++)
{
for(j=w[i];j<=tw;j++)dp1[j]=max(v[i]+dp[j-w[i]],dp[j]);
for(j=1;j<=tw;j++)dp[j]=dp1[j];
}
fout<<dp[tw]<<endl;
}
int main()
{
fin>>n>>tw;
for(i=1;i<=n;i++)fin>>w[i]>>v[i];
solve();
return 0;
}
