Cod sursa(job #2998851)
Utilizator | Data | 10 martie 2023 10:05:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, w[5001], p[5001], a[5001][10001];
int main(){
fin>>n>>g;
for(int i=1; i<=n; i++)
fin>>w[i]>>p[i];
for(int i=1; i<=n; i++){
for(int j=g; j>=w[i]; j--){
a[i][j] = max(a[i-1][j], p[i]+a[i-1][j-w[i]]);
}
}
fout<<a[n][g];
}