Cod sursa(job #1496814)
Utilizator | Data | 5 octombrie 2015 17:29:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
#define NMAX 5005
int n,g,w[NMAX],p[NMAX],dp[NMAX*2],i, j;
int main(){
cin>>n>>g;
for(i=1; i<=n; i++)
cin>>w[i]>>p[i];
for(i=1; i<=n; i++)
for(j=g; j>=w[i]; j--)
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
cout<<dp[g];
return 0;
}