Pagini recente » Cod sursa (job #775042) | Cod sursa (job #1003093) | Cod sursa (job #2853260) | Cod sursa (job #1456239) | Cod sursa (job #1535490)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n,g,a[5000][10000],i,j,w[100],p[100];
fin>>n>>g;
for(i=1;i<=n;++i)
fin>>w[i]>>p[i];
for(i=1;i<=n;++i)
for(j=1;j<=g;++i)
{
a[2][j]=a[1][j];
if(w[i]<=j)
{
a[2][j]=max(a[1][j],a[1][j-w[i]+p[i]);
}
}
cout<<a[2][g];
return 0;
}