Mai intai trebuie sa te autentifici.
Cod sursa(job #2375056)
| Utilizator | Data | 7 martie 2019 22:04:24 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
#define INF 9999999
struct inf
{
int p,g;
}v[5005];
int g,n,dp[10005];
void read()
{
int i;
cin>>n>>g;
for(i=1;i<=n;i++)
{
cin>>v[i].g>>v[i].p;
}
}
void solve()
{
int i,j,sol;
for(i=1;i<=g;i++)
dp[i]=INF;
for(i=1;i<=n;i++)
for(j=g;j>=0;j--)
{
if(dp[j]!=INF)
{
if(dp[j+v[i].g]==INF) dp[j+v[i].g]=dp[j]+v[i].p;
else
dp[j+v[i].g]=max(dp[j+v[i].g],dp[j]+v[i].p);
}
}
sol=0;
for(i=1;i<=g;i++)
if(dp[i]!=INF) sol=max(sol,dp[i]);
cout<<sol;
}
int main()
{
read();
solve();
return 0;
}
