Cod sursa(job #3185336)
| Utilizator | Data | 18 decembrie 2023 19:07:39 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int m[3][1000];
short w[10003], p[5003];
int main()
{
int n, g;
fin>>n>>g;
for(int i=1; i<=n; i++){
fin>>w[i]>>p[i];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=g; j++){
m[1][j] = m[2][j];
if(w[i] <= j){
m[2][j] = max(m[1][j], m[1][j-w[i]] + p[i]);
}
else{
m[2][j] = m[1][j];
}
}
}
fout<<m[2][g];
return 0;
}
