Pagini recente » Cod sursa (job #1724941) | Cod sursa (job #889705) | Cod sursa (job #683196) | Cod sursa (job #2830271) | Cod sursa (job #2485839)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[5010][10010], gr[5010], p[5010] , n, gmax, i, j, maxx, x; /// gr[]=greutatea, p[]=pret
int main()
{
fin>>n>>gmax;
for(i=1; i<=n; i++)
{
fin>>gr[i]>>p[i];
}
for(i=1; i<=n; i++)
{
for(j=1; j<=gmax; j++)
{
if( j-gr[i]<0 )
x=a[i-1][j];
else
{
if( a[i-1][j] > a[i-1][j-gr[i]]+p[i] )
x = a[i-1][j];
else
x = a[i-1][j-gr[i]]+p[i];
}
a[i][j]=x;
}
}
fout<<a[n][gmax];
fin.close();
fout.close();
return 0;
}