Cod sursa(job #2488723)
Utilizator | Data | 7 noiembrie 2019 15:53:47 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, w;
int jones[10041];
int main()
{
int wi, pi;
fin >> n >> w;
for(int i = 0; i < n; i++){
fin >> wi >> pi;
for(int j = w; j >= wi; j--){
jones[j] = max(jones[j-wi]+pi, jones[j]);
}
}
fout << jones[w];
return 0;
}