Cod sursa(job #3216376)
Utilizator | Data | 16 martie 2024 00:15:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,G,W[5001],P[5001],D[10001];
int main()
{
cin>>n>>G;
for(int i=1;i<=n;++i)
{
cin>>W[i]>>P[i];
}
for(int i=1;i<=n;++i)
{
for(int j=G-W[i];j>=0;--j)
{
if(D[j+W[i]]<D[j]+P[i]) D[j+W[i]]=D[j]+P[i];
}
}
cout<<D[G];
return 0;
}