Cod sursa(job #2192152)
| Utilizator | Data | 4 aprilie 2018 20:41:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,a[50],c[50],b[50][50],d[50],p;
int main(){
fin>>n>>g;
for(int i=1; i<=n; i++) fin>>a[i]>>c[i];
for(int i=0; i<a[1]; i++) d[i]=0;
for(int i=a[1]; i<=g; i++) d[i]=c[1];
for(int i=2; i<=n; i++){
for(int j=g; j>=0; j--) if(j+a[i]<=g) d[j+a[i]]=max(d[j+a[i]],d[j]+c[i]);
}
fout<<d[g];
}
