Cod sursa(job #2854504)
Utilizator | Data | 21 februarie 2022 14:25:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int m[5001][10001];
int main()
{
int n, g;
fin>>n>>g;
for(int i = 1; i <= n; i++){
int w, p;
fin>>w>>p;
for(int j = 1; j <= g; j++){
if(j >= w){
m[i][j] = max(m[i-1][j], m[i-1][j-w] + p);
}
}
}
fout<<m[n][g];
return 0;
}