Pagini recente » Cod sursa (job #1286421) | Cod sursa (job #3145331) | Cod sursa (job #1129726) | Cod sursa (job #290045) | Cod sursa (job #1295731)
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
#define nmax 10001
#define omax 5000
int n,o;
int g[omax],v[omax];
int p[nmax];
int rucsac()
{
int i,j;
for(i=0;i<o;++i)
for(j=n;j>=g[i];--j)
{
p[j]=max(p[j],p[j-g[i]]+v[i]);
}
return p[n];
}
int main()
{
ifstream si;
si.open("rucsac.in");
ofstream so;
so.open("rucsac.out");
si>>o>>n;
int i;
for(i=0;i<o;++i)
si>>g[i]>>v[i];
so<<rucsac();
}