Cod sursa(job #1594605)
| Utilizator | Data | 9 februarie 2016 16:50:21 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[2][10001];
int maxi(int a,int b)
{
if(a>=b) return a;
return b;
}
int main()
{
int n,g,i,a,b,j;
fin>>n>>g;
for(i=0;i<n;i++)
{
fin>>a>>b;
for(j=0;j<=g;j++)
{
dp[(i+1)%2][j]=dp[i%2][j];
if(a<=j) dp[(i+1)%2][j]=maxi(dp[i%2][j],dp[i%2][j-a]+b);
}
}
fout<<dp[n%2][g];
}
