Cod sursa(job #2552077)
Utilizator | Data | 20 februarie 2020 15:55:25 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define N 1001
using namespace std;
int cw, p, n, g, a1[N], a2[N], a[N][N];
void citire(){
cin>>n>>g;
for(int i = 1; i <= n; ++i)
cin>>a1[i]>>a2[i];
}
void alg(){
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= g; ++j){
a[i][j] = a[i-1][j];
if(a1[i] <= j)
a[i][j] = max(a[i][j], a[i-1][j-a1[i]] + a2[i]);
}
}
}
int main(){
citire();
alg();
cout<<a[n][g];
}