Cod sursa(job #1900740)
Utilizator | Data | 3 martie 2017 16:14:08 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int N=5005, G=10005;
int n, g, w[N], v[N], dp[N];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;++i)
fin>>w[i]>>v[i];
for(int i=1;i<=n;++i)
for(int j=g;j>=0;--j)
if(w[i]<=j) dp[j]=max(dp[j], dp[j-w[i]]+v[i]);
fout<<dp[g];
return 0;
}