Cod sursa(job #2119668)
| Utilizator | Data | 1 februarie 2018 15:14:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,maxim;
int d[50001],g[10005],c[10005];
int main(){
fin>>n>>G;
for(int i=1;i<=n;i++)
fin>>g[i]>>c[i];
for(int i=1;i<=G;i++)
d[i]=-2000000000;
d[0]=0;
maxim=0;
for(int i=1;i<=n;i++){
for(int j=maxim;j>=0;j--){
if(d[j]>=0&&j+g[i]<=G&&d[j+g[i]]<d[j]+c[i]){
d[j+g[i]]=d[j]+c[i];
if(maxim<d[j]+c[i])
maxim=d[j]+c[i];
}
}
}
fout<<maxim;
return 0;
}
