Cod sursa(job #3349016)
| Utilizator | Data | 24 martie 2026 23:09:32 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define nmax 10001
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g,dp[nmax],x,c,ans;
int main()
{
cin>>n>>g;
for(int i=1;i<=g;i++)
dp[i]=-1;
while(n--){
cin>>x>>c;
for(int i=g-x;i>=0;i--)
if(dp[i]!=-1)
dp[i+x]=max(dp[i+x],dp[i]+c);
}
for(int i=1;i<=g;i++)
ans=max(ans,dp[i]);
cout<<ans;
return 0;
}
