Cod sursa(job #2505886)
Utilizator | Data | 7 decembrie 2019 11:36:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int MAT[2][20001];
int G,N;
struct salut
{
int g,p;
};
salut Ruc[20000];
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;
}