Cod sursa(job #3140679)
Utilizator | Data | 8 iulie 2023 16:00:51 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
int w[5001],p[5001],dp[5001];
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int main()
{
int n,g;
cin>>n>>g;
for(int i=1;i<=n;i++)
cin>>w[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=g;j>=w[i];j--)
dp[j]=max(dp[j],p[i]+dp[j]-w[i]);
cout<<dp[g];
return 0;
}