Cod sursa(job #2110250)
Utilizator | Data | 20 ianuarie 2018 13:49:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,W;
int v[100],w[100],i,j; int m[100];
cin >>n>>W;
for (int i=0;i<n;i++)
cin>>v[i]>>w[i];
for (j= 0 ;j< W;j++)
m[0, j] = 0;
for (i=1;i<n;i++)
for (j= 0;j<W;j++)
if (w[i] > j)
m[i, j] = m[i-1, j];
m[i, j] = max(m[i-1, j], m[i-1, j-w[i]] + v[i]);
cout<<m[n,W];
return 0;
}