Pagini recente » Cod sursa (job #3120985) | Cod sursa (job #769831) | Cod sursa (job #2037887) | Cod sursa (job #493784) | Cod sursa (job #1592926)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[2][10005], x[5005], y[5005];
int main()
{
int n, s, l = 0;
cin >> n >> s;
for(int i = 0; i < n; i++)
cin >> x[i + 1] >> y[i + 1];
for(int i = 1; i <= n; i++, l = 1 - l)
for(int j = 0; j <= s; j++)
{
dp[l][j] = dp[1 - l][j];
if(j >= x[i])
dp[l][j] = max(dp[l][j], dp[1 - l][j - x[i]] + y[i]);
}
cout << max(dp[0][s], dp[1][s]);
return 0;
}