Cod sursa(job #1900773)
Utilizator | Data | 3 martie 2017 16:23:49 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int N=5005, G=10005;
int n, g, sol, w[N], v[N], dp[G];
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-w[i];j>=0;--j)
if(dp[j]+v[i]>dp[j+w[i]])
dp[j+w[i]]=dp[j]+v[i], sol=max(sol, dp[j+w[i]]);
fout<<sol;
return 0;
}