Cod sursa(job #3130461)
Utilizator | Data | 17 mai 2023 20:23:48 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int w[5005],v[5005];
int d[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 >> w[i] >> v[i];
for(int i=1;i<=n;i++)
{
for(int j=g;j>=w[i];j--)
{
d[j]=max(d[j] , d[j-w[i]]+v[i]);
}
}
cout << d[g];
return 0;
}