Pagini recente » Cod sursa (job #2431529) | Cod sursa (job #57202) | Cod sursa (job #1028273) | Cod sursa (job #2033922) | Cod sursa (job #1822442)
#include <fstream>
using namespace std;
const int N = 10005;
int w[N], p[N], s[N];
int main()
{
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n, l;
in>>n>>l;
int i,j;
for(i=1;i<=n;i++)
in>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=l;j>=1;j--)
if(j-w[i]>=0 && s[j-w[i]]+p[i]>s[j])
s[j]=s[j-w[i]]+p[i];
}
int maxi=s[1];
for(i=1;i<=l;i++)
if(s[i]>maxi)maxi=s[i];
out<<maxi;
return 0;
}