Pagini recente » Cod sursa (job #2141768) | Cod sursa (job #974129) | Cod sursa (job #2013565) | Cod sursa (job #772641) | Cod sursa (job #2790569)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int w[100005], p[100005], s[100005];
int main(){
int n, g, r = -1;
cin >> n >> g;
for(int i = 1; i <= n; i ++){
cin >> w[i] >> p[i];
}
for(int i = 1; i <= n; i ++){
for(int j = g - w[i]; j >= 0; j --){
s[j + w[i]] = max(s[j + w[i]], s[j] + p[i]);
r = max(r, s[j + w[i]]);
}
}
cout << r;
return 0;
}