Pagini recente » Cod sursa (job #2663357) | Cod sursa (job #2807280) | Cod sursa (job #2533328) | Cod sursa (job #2699224) | Cod sursa (job #2298540)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,a[5001][2],ruc[10001];
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>a[i][0]>>a[i][1];
}
for(int i=1;i<=n;i++)
{
for(int j=g;j>=0;j--)
{
if(j+a[i][0]<=g)
ruc[j+a[i][0]]=max(ruc[j]+a[i][1],ruc[j+a[i][0]]);
}
}
out<<ruc[g];
return 0;
}