Pagini recente » Cod sursa (job #2258539) | Cod sursa (job #2384111) | Cod sursa (job #57783) | Cod sursa (job #2287605) | Cod sursa (job #2130486)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long a[200005], w[200005], maxi, poz, lmax, n, i, j, p[200005], s[200005], smax, x, sol;
void din()
{
s[0]=0;
sol=0;
for (i=1; i<=n; i++)
{
for (j=x-w[i]; j>=0; j--)
{if (s[j+w[i]]<s[j]+a[i])
s[j+a[i]]=a[i]+s[j];
if (s[j+w[i]]>sol)
sol=s[j+w[i]];
}}
}
void afis()
{
i=x;
while (i!=0)
{
g<<s[i]<<" ";
i=i-s[i];
}
//for (i=1; i<=smax; i++)
// g<<s[i]<<" ";
}
int main()
{
f>>n>>x;
for (i=1; i<=n; i++)
f>>w[i]>>a[i];
din();
/* for (i=1; i<=n; i++)
g<<l[i]<<" ";
for (i=1; i<=n; i++)
g<<p[i]<<" ";*/
// afis();
g<<sol;
}