Pagini recente » Cod sursa (job #2716492) | Cod sursa (job #1150768) | Cod sursa (job #785437) | Cod sursa (job #2368526) | Cod sursa (job #1589787)
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
#include <map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#define MAX 500000000000
//#include <iostream>
using namespace std;
ifstream cin("energii.in");
ofstream cout("energii.out");
int DP[2][5004];
int main()
{
int n, s, x[10004], y[10005], v;
cin >> n >> s;
for(int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
int l = 0;
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[1 - l][j], DP[1 - l][j - x[i]] + y[i]);
}
v = DP[l][s];
}
cout << v;
return 0;
}