Pagini recente » Cod sursa (job #2440105) | Cod sursa (job #1827061) | Cod sursa (job #2205336) | Cod sursa (job #3135188) | Cod sursa (job #1717374)
#include <iostream>
#include <fstream>
using namespace std;
int profit[40000], p[10001], g[10001];
int main(){
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, G;
fin>>n>>G;
for(int i = 1; i <= n; i++){
fin>>g[i]>>p[i];
}
profit[0] = 0;
for(int i = 1; i <= G; i++)
profit[i] = -1;
for(int i = 1; i <= n; i++){
for(int j = G - g[i] ; j >= 0; j--){
if(profit[j] != -1)
if(profit[j] + p[i] > profit[j + g[i]])
profit[j + g[i]] = profit[j] + p[i];
}
}
fout<<profit[G];
fin.close();
fout.close();
return 0;
}