Cod sursa(job #1363653)
| Utilizator | Data | 27 februarie 2015 09:35:51 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
inline int maxi(int a,int b)
{
if(a>=b) return a;
return b;
}
int dp[2][10001];
int main()
{
int n,g,i,w,j,p;
fin>>n>>g;
for(i=1;i<=n;i++)
{
fin>>w>>p;
for(j=0;j<=g;j++)
{
if(j>=w) dp[1][j]=maxi(dp[0][j],dp[0][j-w]+p);
else dp[1][j]=dp[0][j];
}
memcpy(dp[0],dp[1],sizeof(dp[1]));
}
fout<<dp[1][g];
}
