Cod sursa(job #1379013)
| Utilizator | Data | 6 martie 2015 15:41:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int dp[2][10005],w[5005],p[5005],N,G;
void Read()
{
in>>N>>G;
for(int i=1;i<=N;i++)
in>>w[i]>>p[i];
for(int j=0;j<=G;j++)
{
if(w[1]<=j)
dp[1][j]=p[1];
}
for(int i=2;i<=N;i++)
{
for(int j=0;j<=G;j++)
{
if(w[i]<=j)
dp[2][j]=max(dp[1][j],dp[1][j-w[i]]+p[i]);
else
dp[2][j]=dp[1][j];
}
for(int j=0;j<=G;j++)
{
swap(dp[1][j],dp[2][j]);
}
}
}
int main()
{
Read();
out<<dp[1][G];
return 0;
}
