Cod sursa(job #2480257)
Utilizator | Data | 25 octombrie 2019 09:57:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
struct boi
{
int w,p;
};
boi v[5005];
int best[10005];
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,g;
cin>>n>>g;
for(int i=1;i<=n;i++)
{
cin>>v[i].w>>v[i].p;
}
int ma=0;
for(int i=1;i<=n;i++)
{
for(int j=g-v[i].w;j>=0;j--)
if(best[j]+v[i].p>best[j+v[i].w])
{
best[j+v[i].w]=best[j]+v[i].p;
if(best[j+v[i].w]>ma)
ma=best[j+v[i].w];
}
}
cout<<ma;
return 0;
}