Cod sursa(job #2174330)
| Utilizator |  Tirisi Claudiu Justice88 |
Data | 16 martie 2018 11:37:51 |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream o("rucsac.out");
int n, g, w, p, a[3][10005];
int main(){
f>>n>>g;
for(int i=1;i<=n;i++){
f>>w>>p;
for(int j=1;j<=g;j++){
if(w>j){
a[2][j]=a[1][j];
} else {
a[2][j]=max(p+a[1][j-w],a[1][j]);
}
}
for(int j=1;j<=g;j++){
a[1][j]=a[2][j];
}
}
o<<a[1][g];
return 0;
}
