Pagini recente » Cod sursa (job #1709424) | Cod sursa (job #1671069) | Cod sursa (job #2229520) | Cod sursa (job #2536799) | Cod sursa (job #2394146)
#include <fstream>
#define g first
#define p second
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,i,j,G,sc,maxim;
int D[10002];
pair <int,int> v[5002];
int main(){
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>v[i].g>>v[i].p;
D[0]=0;
for(i=1;i<=G;i++)
D[i]=-1;
for(i=1;i<=n;i++){
for(j=G;j>=0;j--){
sc=j+v[i].g;
if(D[j]!=-1 && sc<=G){
D[sc]=max(D[sc],D[j]+v[i].p);
maxim=max(maxim,D[sc]);
}
}
}
fout<<maxim;
return 0;
}