Cod sursa(job #3277876)
Utilizator | Data | 17 februarie 2025 18:33:54 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10005];
int main()
{
int n, maxg,masa, profit;
cin>>n>>maxg;
for(int i=1; i<=n; i++)
{
cin>>masa>>profit;
for(int j=maxg-masa; j>=0; j--)
dp[j+masa]=max(dp[j+masa], dp[j]+profit);
}
cout<<dp[maxg];
return 0;
}