Pagini recente » Cod sursa (job #687236) | Cod sursa (job #1502903) | Cod sursa (job #2530597) | Cod sursa (job #1891810) | Cod sursa (job #1540154)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,G[50001],P[50001],s[100001],Max,i,j;
int main()
{
f>>n>>gmax;
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(Max<s[j+G[i]])Max=s[j+G[i]];
}
g<<Max;
return 0;
}