Pagini recente » Cod sursa (job #956122) | Cod sursa (job #2192797) | Cod sursa (job #452663) | Cod sursa (job #2139730) | Cod sursa (job #2772542)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n, gr, a[2][10001], g[5001], p[5001];
int main()
{
fin>>n>>gr;
for(int i=1; i<=n; i++)
{
fin>>g[i]>>p[i];
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=gr; j++)
{
a[0][j]=a[1][j];
if(g[i]<=j)
{
a[1][j]=max(a[0][j], a[0][j-g[i]]+p[i]);
}
}
}
fout<<a[1][gr];
return 0;
}