Pagini recente » Cod sursa (job #1043527) | Cod sursa (job #2293978) | Cod sursa (job #463551) | Cod sursa (job #1160123) | Cod sursa (job #1007110)
#include <iostream>
#include <fstream>
#define nmax 5001
#define gmax 10001
int D[nmax][gmax];
int v[nmax], g[nmax];
int N, G;
int max(int a, int b){
return (a > b)?a:b;
}
int main()
{
std::fstream in,out;
in.open("rucsac.in", std::ios::in);
out.open("rucsac.out", std::ios::out);
in >> N >> G;
for(int i = 1; i <= N; i++){
in >> g[i] >> v[i];
}
for(int i = 1; i <= N; i++){
for(int gC = 0; gC <= G; gC++){
D[i][gC] = D[i - 1][gC];
if (g[i] <= gC){
D[i][gC] = max(D[i][gC], D[i-1][gC - g[i]] + v[i]);
}
}
}
out << D[N][G];
in.close();
out.close();
return 0;
}