Cod sursa(job #2769329)
Utilizator | Data | 14 august 2021 18:35:36 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int g[100005], p[100005];
int s[100005];
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int main(){
int n, w, r = -1;
cin >> n >> w;
for(int i = 1; i <= n; i ++){
cin >> g[i] >> p[i];
}
for(int i = 1; i <= n; i ++){
for(int j = w - g[i]; j >= 0; j --){
s[j + g[i]] = max(s[j + g[i]], s[j] + p[i]);
r = max(r, s[j + g[i]]);
}
}
cout << r;
}