Cod sursa(job #2493185)
Utilizator | Data | 16 noiembrie 2019 09:29:30 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10041];
int main(){
int n, w;
fin >> n >> w;
int wa, pa;
for(int i = 0; i < n; i++){
fin >> wa >> pa;
for(int j = w; j >= wa; j--){
v[j] = max(v[j], v[j-wa] + pa);
}
}
fout << v[w];
return 0;
}