Cod sursa(job #2478849)
Utilizator | Data | 22 octombrie 2019 20:01:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct rucsac
{
int greu,val;
} v[10000];
int dp[10000],n,gmx,mx,i,j;
int main()
{
f>>n>>gmx;
for(i=1; i<=n; i++)f>>v[i].greu>>v[i].val;
for(i=1; i<=n; i++)
{
for(j=gmx-v[i].greu; j>=0; j--)
dp[j+v[i].greu]=max(dp[j+v[i].greu],dp[j]+v[i].val);
}
for(i=1; i<=gmx; i++)
{
mx=max(dp[i],mx);
}
g<<mx;
}