Pagini recente » Cod sursa (job #3219282) | Cod sursa (job #557261) | Cod sursa (job #1828665) | Cod sursa (job #1161785) | Cod sursa (job #2119672)
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,maxim;
int d[10005],g[5001],c[5001];
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]=-5000000;
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;
}