Pagini recente » Cod sursa (job #751904) | Cod sursa (job #1147611) | Cod sursa (job #1563711) | Cod sursa (job #220021) | Cod sursa (job #2797293)
#include <fstream>
#include <climits>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
long long dp[100009] ;
int main()
{
int n, g ;
cin >> n >> g ;
for(int f = 1, a, b ; f <= n ; f ++)
{
cin >> a >> b ;
for(int e = g ; e >= a ; e --)
dp[e] = max(dp[e - a] + b, dp[e]) ;
}
cout << dp[g] ;
return 0;
}