Cod sursa(job #3313871)
| Utilizator | Data | 7 octombrie 2025 10:03:25 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
struct cow
{
int w, p;
};
int dp[5][10005];
int n, g;
cow v[5005];
int main()
{
cin>>n>>g;
for(int i=1; i<=n; i++)
{
cin>>v[i].w>>v[i].p;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=g; j++)
{
dp[2][j]=dp[1][j];
if(j>=v[i].w)
{
dp[2][j]=max(dp[2][j], dp[1][j-v[i].w]+v[i].p);
}
}
for(int j=1; j<=g; j++)
{
dp[1][j]=dp[2][j];
}
}
cout<<dp[1][g];
return 0;
}
