Pagini recente » Cod sursa (job #1255621) | Cod sursa (job #1064650) | Cod sursa (job #1066406) | Cod sursa (job #1821126) | Cod sursa (job #1209492)
#include <fstream>
#include <iomanip>
using namespace std;
ifstream is ("rucsac.in");
ofstream os ("rucsac.out");
int n, g;
int a[5001][10001], P[5001], G[5001];
void Read();
int main()
{
Read();
for(int i = 1; i <= n; ++i)
for(int j = 0; j <= g; ++j)
{
a[i][j] = a[i-1][j];
if(G[i] <= j)
a[i][j] = max(a[i][j], a[i-1][j-G[i]] + P[i]);
}
os << a[n][g];
return 0;
}
void Read()
{
is >> n >> g;
for(int i = 1; i <= n; ++i)
is >> G[i] >> P[i];
}