Pagini recente » Cod sursa (job #2491062) | Cod sursa (job #903243) | Cod sursa (job #2551313) | Cod sursa (job #523996) | Cod sursa (job #2817212)
#include <bits/stdc++.h>
#define obiect pair<int, int>
#define greutate first
#define pret second
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, gr;
int dp[10001];
void read()
{
f>>n>>gr;
int x, y;
for(int i = 1;i <= n;++i)
{
f>>x>>y;
for(int j = gr;j >= 0;--j)
if(j - x >= 0)
dp[j] = max(dp[j - x] + y, dp[j]);
}
int maximum = 0;
for(int i = gr;i >= 0;--i)
maximum = max(maximum, dp[i]);
g<<maximum;
}
int main()
{
read();
return 0;
}