Cod sursa(job #1150652)
| Utilizator | Data | 23 martie 2014 13:49:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<cstdio>
#include<algorithm>
#define maxm 10005
#define maxn 5005
using namespace std;
FILE *f=fopen("rucsac.in","r");
FILE *g=fopen("rucsac.out","w");
int x[2][maxm],n,gg,y,G[maxn],P[maxn],nr=0;
int main (){
fscanf(f,"%d%d",&n,&gg);
for(int i=1;i<=n;i++)
fscanf(f,"%d%d",&G[i],&P[i]);
for(int i=1;i<=n;i++,nr=1-nr)
for(int j=1;j<=gg;j++)
if(j>=G[i])
x[1-nr][j]=max(x[nr][j],x[nr][j-G[i]] + P[i]);
else
x[1-nr][j]=x[nr][j];
fprintf(g,"%d",x[nr][gg]);
return 0;
}