Cod sursa(job #2575377)
| Utilizator | Data | 6 martie 2020 13:10:02 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define nMax 5005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, sol, w[nMax], p[nMax], dp[nMax];
int main()
{
fin >> n >> g;
for(int i=1; i<=n; i++)
fin >> w[i] >> p[i];
for(int i=1; i<=n; i++)
for(int j=g-w[i]; j>=0; j--)
if(dp[j+w[i]]<dp[j]+p[i])
{
dp[j+w[i]]=dp[j]+p[i];
sol=max(sol, dp[j+w[i]]);
}
fout << sol;
return 0;
}
