Pagini recente » Cod sursa (job #2937900) | Cod sursa (job #10901) | Cod sursa (job #1591412) | Cod sursa (job #692010) | Cod sursa (job #1118323)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, i, j, f[2][10001], w[10001], p[10001], k=0;
int main()
{
in>>n>>g;
for(i=1;i<=n;i++)
{
k=1-k;
in>>w[i]>>p[i];
for(j=1;j<=g;j++)
{
f[k][j]=f[1-k][j];
if(f[1-k][j-w[i]]+p[i]>f[k][j] && w[i]<=j) f[k][j]=f[1-k][j-w[i]]+p[i];
}
}
out<<f[k][g];
return 0;
}