Pagini recente » Cod sursa (job #951113) | Cod sursa (job #1072032) | Cod sursa (job #2711183) | Cod sursa (job #1525978) | Cod sursa (job #2174193)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,p,j,i,q,a[3][10001];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{f>>q>>p;
if(q<=G)
{for(j=1;j<q;j++) {a[2][j]=a[1][j];}
for(j=q;j<=G;j++) {a[2][j]=max(a[1][j],a[1][j-q]+p);}}
else for(j=1;j<=G;j++) a[2][j]=a[1][j];
for(j=1;j<=G;j++)a[1][j]=a[2][j];
}
g<<a[1][G];
return 0;
}