Pagini recente » Cod sursa (job #1053649) | Cod sursa (job #2956420) | Cod sursa (job #1828384) | Cod sursa (job #797191) | Cod sursa (job #2226878)
#include <fstream>
using namespace std;
int g, w, i, n, p, Max, j;
int v[10001];
int main () {
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
fin>>n>>g;
for (i=1;i<=g;i++) {
v[i]=-1;
}
for (i=1;i<=n;i++) {
fin>>w>>p;
for (j=g-w;j>=0;j--) {
if (v[j]!=-1) {
if (v[j+w]<v[j]+p)
v[j+w]=v[j]+p;
}
}
}
for (i=1;i<=g;i++)
Max=max(Max,v[i]);
fout<<Max;
return 0;
}