Pagini recente » Cod sursa (job #1723174) | Cod sursa (job #2049920)
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, raspuns=0;
int w[10000], p[10000];
int x[10000];
int main()
{
int i, j;
f>>n>>G;
for(i=1; i<=n; ++i)
f>>w[i]>>p[i];
x[0]=0;
for(i=1; i<=n; ++i)
{
for(j=G-w[i]; j>=0; --j)
{
if(x[j+w[i]] < x[j]+p[i])
{
x[j+w[i]] = x[j]+p[i];
if(x[j+w[i]] > raspuns)
raspuns = x[j+w[i]];
}
}
}
g<<raspuns;
return 0;
}