Cod sursa(job #3343404)
| Utilizator | Data | 27 februarie 2026 12:35:37 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g,dp[10001],a,b,sol;
signed main()
{
cin>>n>>g;
for(int i=1;i<=g;i++)
dp[i]=-1;
for(int i=1;i<=n;i++){
cin>>a>>b;
for(int j=g-a;j>=0;j--)
if(dp[j]!=-1)
dp[j+a]=max(dp[j+a],dp[j]+b);
}
for(int i=1;i<=g;i++)
sol=max(sol,dp[i]);
cout<<sol;
return 0;
}
