Pagini recente » Cod sursa (job #2206841) | Cod sursa (job #1283355) | Cod sursa (job #1533500) | Cod sursa (job #2437352) | Cod sursa (job #2707907)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int profit[10001];
int main()
{
int n,k,i,g,p,j,mx=0;
cin>>n>>k;
profit[0]=0;
for(i=1;i<=k;i++)
profit[i]=-1;
for(i=0;i<n;i++)
{
cin>>g>>p;
for(j=k-g;j>=0;j--)
{
if(profit[j]>-1)
profit[j+g]=max(profit[j+g],profit[j]+p);
}
}
for(i=0;i<=k;i++)
mx=max(mx,profit[i]);
cout<<mx;
return 0;
}