Pagini recente » Cod sursa (job #332535) | Cod sursa (job #1525675) | Cod sursa (job #948077) | Cod sursa (job #1795867) | Cod sursa (job #3237688)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ifstream fin( "rucsac.in" );
ofstream fout( "rucsac.out" );
const int MAXN = 5e3 + 1;
const int MAXW = 1e4 + 1;
int w[MAXN], p[MAXN];
int dp[MAXW];
int main() {
ios_base::sync_with_stdio(0);
fin.tie(0);
int n, wt;
fin >> n >> wt;
for ( int i = 1; i <= n; ++i ) {
fin >> w[i] >> p[i];
}
dp[w[1]] = p[1];
for ( int i = 2; i <= n; ++i ) {
for ( int j = wt; j >= 0; --j ) {
if ( j >= w[i] ) {
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
}
}
}
int res = 0;
for ( int i = 0; i <= wt; ++i ) {
res = max(res, dp[i]);
}
fout << res;
fin.close();
fout.close();
return 0;
}