Cod sursa(job #2213742)
| Utilizator | Data | 17 iunie 2018 01:13:01 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,i,j,G,m,g[5001],p[5001],d[10001];
int main(){
fin>>n>>G;
for(i=1;i<=n;i++){
fin>>g[i];
fin>>p[i];
}
d[0]=1;
for(i=1;i<=n;i++){
for(j=G;j>=0;j--){
if(d[j]!=0 && j+g[i]<=G)
d[j+g[i]]=max(d[j+g[i]],d[j]+p[i]);
}
}
for(i=0;i<=G;i++)
m=max(m,d[i]);
fout<<m-1;
return 0;
}
