Cod sursa(job #2394158)
Utilizator | Divia Negoescu divianegoescu | Data | 1 aprilie 2019 12:49:17 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#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,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);
}
}
for(i=0;i<=G;i++) maxim=max(maxim,D[i]);
fout<<maxim;
return 0;
}