Cod sursa(job #2685968)
| Utilizator | Data | 18 decembrie 2020 10:16:21 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
struct obiecte
{
int w,p;
}v[5050];
int n,g;
int i,j;
int rez;
int dp[10005];
int main()
{
fin>>n>>g;
for (i=1; i<=n; i++)
fin>>v[i].w>>v[i].p;
for (i=1; i<=n; i++)
for (j=g-v[i].w; j>=0; j--)
if (dp[j+v[i].w]<dp[j]+v[i].p)
{
dp[j+v[i].w]=dp[j]+v[i].p;
rez=max(dp[j+v[i].w],rez);
}
fout<<rez;
fout.close();
return 0;
}
