Pagini recente » Cod sursa (job #1467414) | Cod sursa (job #1004253) | Cod sursa (job #2693657) | Cod sursa (job #1349516) | Cod sursa (job #2972242)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
void solve(){
int n, m;
cin >> n >> m;
vi dp(m+1);
for(int i = 0; i < n; i++){
int w, p;
cin >> w >> p;
for(int j = m; j >= 0; j--){
if(j - w < 0)
continue;
dp[j] = max(dp[j], dp[j-w] + p);
}
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}
int main(){
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
}