Pagini recente » Cod sursa (job #1635430) | Cod sursa (job #2964048) | Cod sursa (job #2832664) | Cod sursa (job #1778019) | Cod sursa (job #2849833)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int v[51001], p[5001];
int f[10001];
int i, j, n, m, G, sol;
int main () {
cin>>n>>G;
for (i=1;i<=n;i++){
cin>>v[i]>>p[i];
}
for (i=1;i<=n;i++){
for (j=G;j>=1;j--){
if (f[j]!=0){
if (j+v[i]<=G && f[j]+p[i]>f[j+v[i]])
f[j+v[i]]=f[j]+p[i];
}
}
if (v[i]<=G && p[i]>f[v[i]])
f[v[i]]=p[i];
}
for (i=1;i<=G;i++){
sol=max(sol, f[i]);
}
cout<<sol;
}