Pagini recente » Cod sursa (job #2405910) | Cod sursa (job #1437360) | Cod sursa (job #720380) | Cod sursa (job #2643592) | Cod sursa (job #2665972)
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long LL;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long
#define cin in
#define cout out
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int inf = 2e9;
const LL mod = 1e9 + 7;
const int N = 2e6 + 11;
const LL INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, p[N], w[N], dp[N], G;
//dp[i] - profitul avand greutatea i
void solve(){
cin >> n >> G;
for(int i = 1; i <= n; i++){
cin >> w[i] >> p[i];
}
for(int i = 1; i <= G; i++){
dp[i] = -inf;
}
int ans = 0;
for(int i = 1; i <= n; i++){
for(int j = G; j >= w[i]; j--){
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
ans = max(ans, dp[j]);
}
}
cout << ans << '\n';
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
//cout << setprecision(6) << fixed;
int T = 1;
//cin >> T;
while(T--){
solve();
}
}