Pagini recente » Cod sursa (job #2475526) | Cod sursa (job #2644052) | Cod sursa (job #3235129) | Cod sursa (job #785269) | Cod sursa (job #3262833)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main() {
int n,k;
fin >> n >> k;
vector<int> weights(n);
vector<int> prices(n);
for(int i=0; i<n; i++) {
fin >> weights[i] >> prices[i];
}
vector<int> profit(k+1, -1);
profit[0] = 0;
for(int i=0; i<n; i++) {
for(int j = k; j >= weights[i]; j--) {
if(profit[j-weights[i]] != -1) {
profit[j] = max(profit[j], profit[j-weights[i]] + prices[i]);
}
}
}
int profit_max = -1;
for(auto pr : profit) {
profit_max = max(profit_max, pr);
}
fout << profit_max;
return 0;
}