Mai intai trebuie sa te autentifici.
Cod sursa(job #3139090)
Utilizator | Data | 24 iunie 2023 20:34:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int total, n, g, w, p;
int v[10002];
int main(){
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin >> n >> g;
for(int i = 0; i < n; i++){
fin >> w >> p;
if(p == 0){
continue;
}
total = min(total + w, g);
for(int j = total; j >= w; j--){
v[j] = max(v[j], v[j-w] + p);
}
}
int wins = 0;
for(int i = 0; i <= g; i++) {
wins = max(wins, v[i]);
}
fout << wins;
fin.close();
fout.close();
return 0;
}