Cod sursa(job #3313885)
| Utilizator | Data | 7 octombrie 2025 10:35:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[10005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
int a,b;
cin>>a>>b;
for(int j=m;j>0;j--)
{
if(dp[j]!=0 && j+a<=m)
{
dp[j+a]=max(dp[j+a],dp[j]+b);
}
}
dp[a]=max(dp[a],b);
}
int rez=0;
for(int i=1;i<=m;i++)
rez=max(rez,dp[i]);
cout<<rez;
return 0;
}
