Pagini recente » Cod sursa (job #2002449) | Cod sursa (job #1951552) | Monitorul de evaluare | Rating Razvan (Razvan789) | Cod sursa (job #2190918)
#include <fstream>
using namespace std;
const int maxn = 5005, maxg = 10005;
int n, g;
int r[maxg];
int main() {
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin >> n >> g;
int ans = 0;
for(int i = 1;i <= n;i++) {
int w, p;
fin >> w >> p;
for(int j = g;j >= 0;j--)
if(j + w <= g)
r[j + w] = max(r[j + w], r[j] + p);
}
for(int i = 0;i <= g;i++)
ans = max(ans, r[i]);
fout << ans;
fin.close();
fout.close();
return 0;
}