Pagini recente » Cod sursa (job #1246429) | Cod sursa (job #2548265) | Cod sursa (job #353467) | Cod sursa (job #2282671) | Cod sursa (job #1327566)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main() {
int n,g,x,y,pmax,prof[10005]={0};
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>x>>y;
for(int j=g;j>=0;j++)
if(j+x<=g)
{
prof[j+x]=max(prof[j+x],prof[j]+y);
}
}
pmax=0;
for(int i=1;i<=g;i++)
{
if(pmax<prof[i])
pmax=prof[i];
}
out<<pmax;
in.close();
out.close();
return 0;
}