Pagini recente » Cod sursa (job #1446418) | Cod sursa (job #2153617) | Cod sursa (job #1951906) | Cod sursa (job #1834074) | Cod sursa (job #2174207)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,w[10002],p[10002],a[3][10002];
int main()
{
int i,j;
f>>n>>G;
for(i=1;i<=n;i++) f>>w[i]>>p[i];
int l=0;
for(i=1;i<=n;i++, l=1-l)
for(j=0;j<=G;j++)
{
a[1-l][j]=a[l][j];
if(w[i]<=j)
a[1-l][j]=max(a[l][j],(a[l][j-w[i]]+p[i]));
}
g<<a[l][G]<<'\n';
f.close();
g.close();
return 0;
}