Pagini recente » Cod sursa (job #906839) | Cod sursa (job #2240011) | Cod sursa (job #2988270) | Cod sursa (job #2468894) | Cod sursa (job #2750594)
#include <fstream>
using namespace std;
int sol[110];
int g[110];
int v[110];
int i,j,n,G,Max;
int main() {
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>G;
for (i=1;i<=n;i++) {
fin>>g[i]>>v[i];
}
for (i=1;i<=G;i++) {
sol[i]=-1;
}
for (i=1;i<=n;i++) {
for (j=G;j>=0;j--) {
if (sol[j]!=-1) {
if (j+g[i]<=G) {
sol[j+g[i]]=sol[j]+v[i];
}
}
}
}
Max=INT_MIN;
for (i=1;i<=G;i++) {
Max=max(Max,sol[i]);
}
fout<<Max;
return 0;
}