Pagini recente » Cod sursa (job #1525594) | Cod sursa (job #2694451) | Cod sursa (job #258734) | Cod sursa (job #265621) | Cod sursa (job #2138767)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,m,maxx;
int ans[10001];
int main()
{
in>>n>>g;
for(int i = 1;i<=g;i++)
ans[i]=INT_MAX;
for(int i = 1;i<=n;i++)
{
int w,p;
in>>w>>p;
for(int j = g-w;j>=0;j--)
{
if(ans[j+w]!=INT_MAX)
ans[j+w]=max(ans[j+w],ans[j]+p);
else
ans[j+w]=ans[j]+p;
}
}
for(int i = 0;i<=g;i++)
if(ans[i]>maxx)
maxx=ans[i];
out<<maxx;
return 0;
}