Pagini recente » Cod sursa (job #975903) | Cod sursa (job #183179) | Cod sursa (job #1893394) | Cod sursa (job #2656834) | Cod sursa (job #2505878)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int MAT[1001][1001];
int G,N;
struct salut
{
int g,p;
};
salut Ruc[1000];
int main()
{
fin>>N>>G;
for(int i=1;i<=N;i++)
fin>>Ruc[i].g>>Ruc[i].p;
int k=0;
for(int i=1;i<=N;i++,k=1-k)
for(int j=1;j<=G;j++)
if(j>=Ruc[i].g)
MAT[k][j]=max(MAT[1-k][j],MAT[1-k][j-Ruc[i].g]+Ruc[i].p);
else
MAT[k][j]=MAT[1-k][j];
fout<<MAT[1-k][G];
return 0;
}