Pagini recente » pregatire_oji_2013 | Cod sursa (job #1484703) | Cod sursa (job #2985098) | Cod sursa (job #373279) | Cod sursa (job #1565082)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int n,gmax,max1,s[100001],j,i,p[50001],g[50001],rez;
int main()
{ f>>n>>gmax;
s[0]=max1=0;
for(i=1;i<=n;i++)
f>>g[i]>>p[i];
for(i=1;i<=n;i++)
for(j=gmax-g[i];j>=0;j--)
if(s[j+g[i]]<s[j]+p[i])
{ s[j+g[i]]=s[j]+p[i];
if(s[j+g[i]]>max1) max1=s[j+g[i]];
}
h<<max1;
return 0;
}